今日温故知新

来源:互联网 发布:遗传算法 pdf 编辑:程序博客网 时间:2024/04/29 17:56

点击打开链接

//1000:#include<stdio.h>int main(){int a,b;while(scanf("%d %d",&a,&b)!=EOF){printf("%d\n",a+b);}return  0;}//1001:#include<stdio.h>int main(){int a,b,N;scanf("%d",&N);while(N-- && scanf("%d %d",&a,&b)!=EOF){printf("%d\n",a+b);}return  0;}//1002:#include<stdio.h>int main(){int a,b;while(scanf("%d %d",&a,&b)!=EOF){if(a==0 && b==0)break;printf("%d\n",a+b);}return  0;}//1003:#include<stdio.h>int main(){int N;int a;while(scanf("%d",&N)!=EOF){int sum=0;if(N==0)break;else{while(N--){scanf("%d",&a);sum += a;}printf("%d\n",sum);}}return 0;}//1004:#include<stdio.h>int main(){int N,M;int a;while(scanf("%d",&N)!=EOF){if(N==0)break;else{while(N--){int sum=0;scanf("%d",&M);while(M--){scanf("%d",&a);sum+=a;}printf("%d\n",sum);}}}return 0;}//1005:#include<stdio.h>int main(){int N,a;while (scanf("%d",&N)!=EOF){int sum = 0;while(N--){scanf("%d",&a);sum+=a;}printf("%d\n",sum);}return 0;}//1006:#include<stdio.h>int main(){int a,b;while(scanf("%d %d",&a,&b)!=EOF){printf("%d\n\n",a+b);}return 0;}//1007:#include<stdio.h>int main(){int N,M;int a;while(scanf("%d",&N)!=EOF){if(N==0)break;else{while(N--){int sum=0;scanf("%d",&M);while(M--){scanf("%d",&a);sum += a;}printf("%d\n\n",sum);}}}return 0;}//1008:####失败的代码#####define _CRT_SECURE_NO_WARNINGS#include<stdio.h>int main(){int T,temp;int c;int i,j;int a[1000]={0};//防烫while (scanf("%d",&T)!=EOF){temp = T;if(T<1 || T>1000)break;else{i=0;while(T--){scanf("%d",&c);a[i++] = c;}for(j=0;j<=temp;j++)printf("%c",a[j]);printf("\n");}}return 0;}##################通过的代码:#include<stdio.h>int main(){int T;int a[1001]={0};int i;scanf("%d",&T);for(i=0;i<T;i++){scanf("%d",&a[i]);}for(i=0;i<T;i++){if(a[i] >= 32){printf("%c",a[i]);}}return 0;}


0 0
原创粉丝点击