- 博客(105)
- 收藏
- 关注
RSS订阅原创 PAT-A1127
前几天去刷了PAT，趁热把答案记录下来供大家参考这题完全是英语阅读题，题目读懂就能写题意：BST，给中序序列和后序序列，重建这颗树，并将树按"Z"字型输出#include#include#includeusing namespace std;int n;int in[40], post[40];struct node{ int data; int level;
2017-03-09 13:40:33
891
原创 PAT-A1126
前几天去刷了PAT，趁热把答案记录下来供大家参考这题完全是英语阅读题，题目读懂就能写我考试的时候花了起码10分钟去读题，英语实在太渣第3个测试点是个坑点，考的时候提交了11次才出来第3个测试点：关键字：connected graph，要先判断图是否是一个连通图#include#includeusing namespace std;const int INF=1
2017-03-09 13:38:39
731
原创 PAT-A1125
前几天去刷了PAT，趁热把答案记录下来供大家参考这题完全是英语阅读题，题目读懂就能写题意：两根绳子打结之后长度会变成原来绳长的一般，且向下取整一维数组加sort函数搞定#include#includeusing namespace std;int rope[10010];int main(){int i, n, sum;scanf("%d",&n);for(i=0
2017-03-09 13:03:51
281
原创 PAT-A1124
#include#include#include#includeusing namespace std;int m, n, s;vector ve;map mp;int main(){int i;string temp;bool flag=false;//flag表示是否输出过数据cin>>m>>n>>s;getchar();for(i=0;i<m;i++){ ci
2017-03-09 12:47:01
201
原创 PAT-A1121
#include#includeusing namespace std;int peo[100010]={0};int main(){int i, n, a, b, m;scanf("%d",&n);for(i=0;i<n;i++){ scanf("%d%d",&a,&b); peo[a]=b; peo[b]=a;}scanf("%d",&m);set st, temp;
2017-03-08 20:07:22
405
原创 PAT-A1120
#include#includeusing namespace std;int cal(int x){ int sum=0; while(x>0){ sum+=x%10; x/=10; } return sum;}int main(){int i, n, t;setst; scanf("%d",&n);for(i=0;i<n;i++){ scanf("%d",&
2017-03-08 20:07:05
342
原创 PAT-A1117
#includeint day[1000010]={0}, day1[1000010]={0};int main(){int i, n, max=0, temp, pre=1000005, sum=0, result=0;scanf("%d",&n);for(i=0;i<n;i++){ scanf("%d",&temp); day[temp]++; if(temp>max)max
2017-03-08 20:04:42
377
原创 PAT-A1116
#include#includeint flag[10010]={0};bool check(int k){ int i, sqr=(int)sqrt(double(k)); for(i=2;i<=sqr;i++){ if(k%i==0)return false; } return true;}int main(){int i, n, k, rank=1, temp;sc
2017-03-08 20:04:26
415
原创 PAT-A1113
#include#includeusing namespace std;int d[100010];int main(){int i,n, sum1=0, sum2=0;scanf("%d",&n);for(i=0;i<n;i++){ scanf("%d",&d[i]);}sort(d,d+n);for(i=0;i<n/2;i++){ sum1+=d[i];}for(i
2017-03-08 20:04:04
285
原创 PAT-A1118
#include#include#includeusing namespace std;int n, Q, sum=0;int father[10010];bool isfather[10010]={false};set st;int findfather(int x){ int a=x, aa; while(father[x]!=x){ x=father[x]; }
2017-03-08 20:03:29
293
原创 PAT-A1115
#include#includeusing namespace std;struct pnode{ int data; pnode* left; pnode* right; int level; pnode():left(NULL),right(NULL){}};int num_last=0, num_second=0, maxlevel=0;void insert(pnod
2017-03-08 20:02:58
71
原创 PAT-A1111
#include#include#include#includeusing namespace std;const int MAXV=510;const int INF=1000000000;int n, m, from, to;int G[MAXV][MAXV], Time[MAXV][MAXV];int d[MAXV], t[MAXV];bool vis[MAXV]={fa
2017-03-08 20:02:54
267
原创 PAT-A1110
#include#include#includeusing namespace std;struct pnode{ int left, right; pnode():left(-1),right(-1){}}node[25];int father[25];int main(){int i, n, id, root, count=0, last=0;char t1[5], t2
2017-03-08 20:02:20
343
原创 PAT-A1108
#include#include#includeusing namespace std;bool check(char str[]){ int i, diancount=0, len=strlen(str); for(i=0;i<len;i++){ if(str[i]=='-')continue; if(str[i]=='.'){ diancount++; if(d
2017-03-08 19:54:20
917
原创 PAT-A1107
#include#includeusing namespace std;int hobby[1010]={0}, father[1010]={0}, num[1010]={0};bool cmp(int a,int b){ return a>b;}int find_father(int x){ int temp=x; while(father[x]!=x){ x=father
2017-03-08 19:54:05
515
原创 PAT-A1104
#includeint main(){int i, j, n;double ans=0,d[100010]={0};scanf("%d",&n);for(i=1;i<=n;i++){ scanf("%lf",&d[i]); ans=ans+d[i]*i*(n-i+1); }printf("%0.2f\n",ans);return 0;}
2017-03-08 19:53:43
301
原创 PAT-A1109
#include#include#includeusing namespace std;struct people{ char name[15]; int height;}peo[10010];bool cmp(people a , people b){ if(a.height!=b.height) return a.height>b.height; else return s
2017-03-08 19:53:18
448
原创 PAT-A1106
#include#include#includeusing namespace std;int n, min_level=110000, num=0;double p, r;struct pnode{ vector child;}node[100010];void DFSorder(int root, int depth){ if(node[root].child.size(
2017-03-08 19:52:41
410
原创 PAT-A1103
#include#includeusing namespace std;int n, k, p, max_facsum=-1;vector fac, temp, ans;int get_p(int a){ int loop=0, ans=1; while(loop<p){ans=ans*a; loop++;} return ans;}void DFS(int index, in
2017-03-08 19:52:25
422
原创 PAT-A1102
#include#includeusing namespace std;int n, sum=0;bool have_root[15]={false};struct pnode{ int left, right;}node[15];int check(char a){ if(a=='-')return -1; else {have_root[a-'0']=true;return
2017-03-08 19:51:54
285
原创 PAT-A1101
#include#includeusing namespace std;int a[100010]={0},maxx[100010]={0},minn[100010]={0},ans[100010]={0};int main(){int i, n, max=0, min=1000000000;scanf("%d",&n);for(i=0;i<n;i++){ scanf("%d",&
2017-03-08 19:51:32
355
原创 PAT-A1100
#include#include#include#includeusing namespace std;string aaa[13]={"tret","jan","feb","mar","apr","may","jun","jly","aug","sep","oct","nov","dec"};string bbb[13]={"tret","tam","hel","maa","huh"
2017-03-08 19:47:54
240
原创 PAT-A1098
#include#includeusing namespace std;int n, orign[111]={0}, orign1[111]={0}, result[111]={0};bool cmp(int a[], int b[]){ for(int i=1;i<=n;i++){ if(a[i]!=b[i])return false; } return true;}v
2017-03-08 19:40:19
380
原创 PAT-A1096
#include#includeint main(){int i, j, sqr, len, maxstart=-1, maxlen=0;long long temp, n;scanf("%lld",&n);sqr=sqrt(n*1.0);for(i=2;i<=sqr;i++){ temp=1; len=0; for(j=i;j<=sqr;j++){ temp*=j;
2017-03-07 21:09:21
266
原创 PAT-A1099
#include#include#includeusing namespace std;int n, index=0, number[110]={0}, sum=0;struct pnode{ int data; int left, right;}node[110];void inorder(int root){ if(node[root].left!=-1)inorder(n
2017-03-07 21:09:11
66
原创 PAT-A1097
#include#includeusing namespace std;struct pnode{ int address; int data; int next;}node[100010];int flag[10010]={0},ans_in[100010]={-1},ans_not[100010]={-1};int main(){int i, head, n, p, tp
2017-03-07 21:09:09
235
原创 PAT-A1093
#include#include#includeusing namespace std;int main(){char c[100010];int i, len, nump[100010]={0},numt[100010]={0};long long ans=0;scanf("%s",c);len=strlen(c);for(i=1;i<=len;i++){ if(c[i-
2017-03-07 21:06:57
65
原创 PAT-A1094
#include#includeusing namespace std;struct pnode{ vector child;}node[110];int depth_num[110]={0}, max_num=-1, level;void DFS(int root, int depth){ depth_num[depth]++; if(depth_num[depth]>max_
2017-03-07 21:06:51
290
原创 PAT-A1092
#include#includeint main(){int i, len, flag=0, sum=0, ascall[130]={0};char shop[1010], eva[1010];scanf("%s%s",shop,eva);len=strlen(shop);for(i=0;i<len;i++){ ascall[shop[i]]++;}len=strlen(ev
2017-03-07 21:06:25
200
原创 PAT-A1091
#include#include#includeusing namespace std;struct pnode{ int x,y,z;}node, front;int m, n, L , T, ans=0, matrix[1300][130][62];bool inq[1300][130][62]={false};int xx[6]={0,0,0,0,1,-1};int yy
2017-03-07 21:01:52
270
原创 PAT-A1090
#include#include#include#includeusing namespace std;int n, max_level=-1, sum=0;double p, r, ans=0;struct pnode{ int level; vector child;}node[100010];void levelorder(int root){ node[root
2017-03-07 21:01:14
220
原创 PAT-A1088
#include#includeusing namespace std;long long gcd(long long a,long long b){ if(b==0)return a; else return gcd(b,a%b);}void show(long long up,long long down){ long long d; if(down<0){up=-
2017-03-07 21:00:06
275
原创 PAT-A1085
#include#includeusing namespace std;int aa[100010]={0};int main(){int i, j, n, p, m, M, left, right, mid, ans=1;scanf("%d%d",&n,&p);for(i=0;i<n;i++)scanf("%d",&aa[i]);sort(aa,aa+n);for(i=0;i
2017-03-07 20:59:44
218
原创 PAT-A1084
#include#includeint main(){char s1[85], s2[85];int i, j;int table[130]={0};scanf("%s%s",s1,s2);for(i=0;i='a'&&s1[i]<='z')s1[i]=s1[i]-32; }for(i=0;i='a'&&s2[i]<='z')s2[i]=s2[i]-32; }for(i=0;i
2017-03-07 20:59:32
244
原创 PAT-A1086
#include#include#include#include#includeusing namespace std;int n, sum=0, pre[35]={0}, in[35]={0};struct pnode{ int data; pnode *left; pnode *right;};pnode * DFS(int preL,int preR, int inL
2017-03-07 20:58:41
335
原创 PAT-A1083
#include#include#includeusing namespace std;struct student{ char name[12],id[12]; int grade;}stu[100];bool cmp(student a, student b){ return a.grade>b.grade;}int main(){int i, n, g1, g2;s
2017-03-07 20:58:32
166
原创 PAT-A1081
#include#includelong long gcd(long long a,long long b){ if(b==0)return a; else return gcd(b,a%b);}int main(){int i, n ;long long d, up=0, down=1,temp_up, temp_down;scanf("%d",&n);for(i=0
2017-03-07 20:55:59
319
原创 PAT-A1078
#include#includeint hash[100010]={0};bool judge(int a){//是素数则返回true if(a<=1)return false; int i, sqr=sqrt(a*1.0); for(i=2;i<=sqr;i++) if(a%i==0)return false; return true;}int main(){int i,
2017-03-07 20:54:03
438
原创 PAT-A1077
#include#includechar cc[100][256];int main(void){ int i, j, n, flag=1, minlen=256, an=0; char temp, std, ans[260]={""}; scanf("%d",&n); getchar(); for(i=0;i<n;i++){ gets(cc[i]); if
2017-03-07 20:53:48
287
原创 PAT-A1073
#include#includeint main(){ int i, j, z=0, len1, posi, exp=0; double temp=0.0, weigh=0.1; char cc[100000]; scanf("%s",cc); len1=strlen(cc); if(cc[0]=='-')printf("-"); for(i=2;i<len1;i++){/
2017-03-07 20:52:29
345
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人