PAT
关注
分享
扫一扫
文章平均质量分 68
石窟寺前写代码
云淡风轻
展开
-
PAT 1051
//map在主函数中定义#include#include#include#include#includeusing namespace std;int main(){ stack st; int m,n,k; int cmp[1010]; scanf("%d%d%d",&m,&n,&k); while(k--) { while(!st.empty())原创 2017-02-23 15:32:20 · 233 阅读 · 0 评论 -
PAT 1079
#include#include#include#include#include#include#include#includeusing namespace std;const int maxn=100010;struct Node{ int weight; vector child;}node[maxn];int n;double p,r;double原创 2017-02-26 11:14:28 · 292 阅读 · 0 评论 -
PAT 1125
#include#include#include#include#includeusing namespace std;vector a;int main(){ int n; scanf("%d",&n); int temp; for(int i=0;i<n;i++) { scanf("%d",&temp); a.push_back(temp); } so原创 2017-03-04 22:22:47 · 400 阅读 · 0 评论 -
PAT 1120
#include#include#include#include#include#includeusing namespace std;int change(int a){ int temp,sum=0; while(a!=0) { temp=a%10; a=a/10; sum=sum+temp; } return sum;}set s;int ma原创 2017-03-05 08:48:24 · 278 阅读 · 0 评论 -
PAT 1121
#include#include#include#include#include#includeusing namespace std;const int maxn=100010;const int INF=100000;set sample,single;int table[maxn];vector s;int main(){ fill(table,table+ma原创 2017-03-05 11:19:59 · 300 阅读 · 0 评论 -
PAT 1060
#include#include#include#include#includeusing namespace std;int n;string str1,str2,str3,str4;string change(string s,int &e){ e=0; int k=0; int num=0; string res; while(s.length()>0&&s[0原创 2017-03-05 15:51:00 · 341 阅读 · 0 评论 -
PAT 1073
#include#include#include#include#includeusing namespace std;int main(){ string s; cin>>s; if(s[0]=='+') s.erase(s.begin()); else { printf("-"); s.erase(s.begin()); } int dotnum=s原创 2017-03-05 16:57:39 · 261 阅读 · 0 评论 -
PAT 1090
#include#include#include#include#include#include#include#includeusing namespace std;const int maxn=100010;struct Node{ int weight; vector child;}node[maxn];int n;double p,r;double原创 2017-02-26 14:16:33 · 359 阅读 · 0 评论 -
PAT 1106
#include#include#include#include#include#include#include#includeusing namespace std;const int maxn=100010;struct Node{ int weight; vector child;}node[maxn];int n;double p,r;double原创 2017-02-26 14:33:02 · 307 阅读 · 0 评论 -
PAT 1094
#include#include#include#include#include#include#include#includeusing namespace std;const int maxn=100010;struct Node{ int weight; vector child;}node[maxn];int n;int p;int ans=0;i原创 2017-02-26 15:05:04 · 237 阅读 · 0 评论 -
PAT 1053
#include#include#include#include#include#include#includeusing namespace std;const int maxn=100;int path[maxn];//路径上存放的结点编号struct Node{ int weight; vector child;}node[maxn];bool cmp(i原创 2017-02-26 10:04:45 · 252 阅读 · 0 评论 -
PAT 1102
#include#include#include#include#include#include#includeusing namespace std;const int maxn=40;stack s;vector le;vector in;bool hashtable[11]={false};//int pre[maxn],in[maxn];//int preL,原创 2017-02-25 20:45:30 · 309 阅读 · 0 评论 -
PAT 1032
#include#include#include#include#includeusing namespace std;const int maxn=100010;struct Node{ char data; int next; bool flag;}node[maxn]; int main(){ int s1,s2,n; scanf("%d%d%d",&原创 2017-02-23 19:53:33 · 301 阅读 · 0 评论 -
PAT 1052
#include#include#include#include#includeusing namespace std;const int maxn=100010;struct Node{ int data; int address; int next; bool flag;}node[maxn]; bool cmp(Node a,Node b){ if(a.原创 2017-02-23 22:19:50 · 321 阅读 · 0 评论 -
PAT 1074
#include#include#include#include#includeusing namespace std;const int maxn=100010;struct Node{ int address; int data; int next; int order;}node[maxn]; bool cmp(Node a,Node b){ retur原创 2017-02-24 10:25:20 · 329 阅读 · 0 评论 -
PAT 1097
#include#include#include#include#includeusing namespace std;const int maxn=100010;struct Node{ int address; int data; int next; int order;}node[maxn]; bool cmp(Node a,Node b){ retur原创 2017-02-24 14:02:35 · 278 阅读 · 0 评论 -
PAT 1103
#include#include#include#include#includeusing namespace std;int n,k,p;int maxsqu=-1;vector fac,temp,ans;int power(int x,int y){ int ans=1; while(y) { ans=x*ans; y--; } return ans;原创 2017-02-24 21:11:30 · 411 阅读 · 0 评论 -
PAT 1129
#include#include#include#include#include#includeusing namespace std;const int maxn=50;struct Node{ Node* lchild; Node* rchild; int data; int layer;};int n;int num=0;int post[maxn],in原创 2017-03-08 14:29:44 · 432 阅读 · 0 评论 -
PAT 1091
#include#include#include#include#include#includeusing namespace std;int X[6]={0,0,0,0,1,-1};int Y[6]={1,0,-1,0,0,0};int Z[6]={0,1,0,-1,0,0};int m,n,l,t;bool inq[1290][130][60]={false};in原创 2017-02-25 15:29:31 · 317 阅读 · 0 评论 -
PAT 1020
#include#include#include#include#include#includeusing namespace std;vector op;struct node{ node* lchild; node* rchild; int data;};int post[40],in[40];int postL,postR,inL,inR;node* c原创 2017-02-25 17:13:07 · 313 阅读 · 0 评论 -
PAT 1086
//当你真的专注时，环境就不会影响到你。//永远不要当分母#include#include#include#include#include#include#includeusing namespace std;const int maxn=40;stack s;vector op;int pre[maxn],in[maxn];int preL,preR,inL,inR;原创 2017-02-25 19:16:52 · 318 阅读 · 0 评论 -
PAT 1004
#include#include#include#include#include#include#include#includeusing namespace std;const int maxn=100010;struct Node{ int weight; vector child;}node[maxn];int n;int p;int ans=0;i原创 2017-02-26 15:25:28 · 231 阅读 · 0 评论 -
PAT 1110
#include#include#include#include#include#include#includeusing namespace std;const int maxn = 1000;struct Node{ int lchild, rchild;}node[maxn];bool table[maxn] = {false};int test[maxn]原创 2017-03-09 07:40:30 · 443 阅读 · 0 评论 -
PAT 1115
#include#include#include#include#includeusing namespace std;const int maxn = 1010;int in[maxn];struct Node{ Node* lchild; Node* rchild; int data; int depth;};void insert(Node* &root,int原创 2017-03-09 08:43:49 · 413 阅读 · 0 评论 -
PAT 1069
#include#include#include#include#include#include#include#includeusing namespace std;void intoarray(int n,int num[]){ for(int i=0;i<4;i++) { num[i]=n%10; n=n/10; }}int atoin(int nu原创 2017-03-06 16:41:38 · 527 阅读 · 0 评论 -
PAT 1008
#include#include#include#include#include#include#include#includeusing namespace std;int main(){ //freopen("input.txt","r",stdin); int n; cin>>n; int a[100100]; a[0]=0; for(int i=1原创 2017-03-06 17:13:25 · 284 阅读 · 0 评论 -
PAT 1008
#include#include#include#include#include#include#include#includeusing namespace std;int main(){ //freopen("input.txt","r",stdin); int n; cin>>n; int a[100100]; a[0]=0; for(int i=1原创 2017-03-06 17:13:52 · 292 阅读 · 0 评论 -
PAT 1008
#include#include#include#include#include#include#include#includeusing namespace std;int main(){ //freopen("input.txt","r",stdin); int n; cin>>n; int a[100100]; a[0]=0; for(int i=1原创 2017-03-06 17:14:30 · 249 阅读 · 0 评论 -
PAT 1049
#include#include#include#include#include#include#include#includeusing namespace std;int main(){ //freopen("input.txt","r",stdin); int n,a=1; int ans=0; int left,now,right; scanf("%d原创 2017-03-06 17:41:24 · 273 阅读 · 0 评论 -
PAT 1081
#include#include#include#include#include#include#include#include#includeusing namespace std;struct fenshu{ int up; int down;}fs[101];int gcd(int a,int b){ if(b==0) return a; else原创 2017-03-06 18:21:54 · 330 阅读 · 0 评论 -
PAT 1088
#include#include#include#include#include#include#include#include#includeusing namespace std;struct fs{ long long u,d; long long z;};long long gcd(long long a,long long b){ if(b==0)原创 2017-03-06 20:15:29 · 383 阅读 · 0 评论 -
PAT 1024
#include#include#include#include#includeusing namespace std;struct bign{ int d[100]; int len; bign() { fill(d,d+100,0); len=0; }};bool judge(bign a){ for(int i=0;i<a.len/2;i+原创 2017-03-07 11:02:54 · 285 阅读 · 0 评论 -
PAT 1066
#include#include#include#include#include#includeusing namespace std;struct Node{ Node* lchild; Node* rchild; int data; int h;};vector in;int gh(Node* root){ if (root == NULL) retur原创 2017-03-10 16:42:22 · 364 阅读 · 0 评论 -
PAT 1107
#include#include#include#include#include#include#include#includeusing namespace std;//union findfather 通过根节点得到组数const int maxn=1010;int father[maxn];vector hobby[maxn];vector s;int num[m原创 2017-02-27 15:38:52 · 350 阅读 · 0 评论 -
PAT 1071
#include#include#include#include#include#include#include#includeusing namespace std;bool judge(char a){ if((a>='0'&&a='a'&&a='A'&&a<='Z')) return false; else return true;}int main(原创 2017-03-06 14:15:14 · 313 阅读 · 0 评论 -
PAT 1043
#include#include#include#include#include#include#include#includeusing namespace std;struct Node{ Node* lchild; Node* rchild; int data;};void insert(Node* &root,int data){ if(root==NU原创 2017-02-26 17:26:26 · 212 阅读 · 0 评论 -
PAT 1064
#include#include#include#include#include#include#include#includeusing namespace std;const int maxn=1010;int n;int cbt[maxn];int temp[maxn];int k=0;void inorder(int index){ if(index>n)原创 2017-02-26 19:42:32 · 295 阅读 · 0 评论 -
PAT 1099
#include#include#include#include#include#include#include#includeusing namespace std;const int maxn=110;int n;int bt[maxn];int temp[maxn];int k=0;int p=0;struct Node{ int lchild; int原创 2017-02-26 20:37:17 · 349 阅读 · 0 评论 -
PAT 1108
#include#include#include#include#includeusing namespace std;int main(){ char a[50],b[50]; int n; cin>>n; bool flag; double temp,average=0.0; int cnt=0; for(int i=0;i<n;i++) { flag=t原创 2017-03-05 17:55:17 · 458 阅读 · 0 评论 -
PAT 1124
#include#include#include#include#include#includeusing namespace std;const int maxn=1010;map flag;int main(){ string a[maxn]; int m,n,s; cin>>m>>n>>s; for(int i=1;i<=m;i++) { cin>>a[i原创 2017-03-05 18:30:09 · 385 阅读 · 0 评论