Binary Problem:1221 Solution:2049693 Language:G++ Result: Time Limit Exceed
#include <stdio.h> int main() { int n,a,sum,max; scanf("%d",&n) ; while(n--) { scanf("%d",&a); for(max=1;a!=0;) {sum=0; for(;a&1==1;a>>=1) {sum++; } if(sum>max) max=sum; a>>=max; } printf("%d\n",max); } return 0; }哥伦比亚数 Problem:1251 Solution:2049959 Language:G++ Result: Time Limit Exceed
#include <stdio.h> int main() { int n,x,a,a1,sum,i,c; scanf("%d",&n); while(n) { scanf("%d",&x); a=x-1; for(i=0;a!=0&&i==0;a--) { sum=a; a1=a; c=100000000; while((a1/c)==0) {c/=10; } for(;c!=0;) { sum=sum+a1/c; a1=a1-c*(a1/c); c=c/10; } if(sum==x) i++; } if(i==0)printf("Yes\n"); else printf("No\n"); n--; } return 0; }平方和 Problem:1054 Solution:2050464 Language:G++ Result: Wrong Answer
#include<stdio.h> main() { int n; int i,l; int a[1001],c[1001]; while (scanf("%d",&n)) { if(n==0) return 0; int count =0; for(i=0;i<n;i++) { scanf("%d",&a[i]); c[i]=a[i]*a[i]; } for(l=0;l<n;l++) { for(i=0;i<n;i++) { if(a[i]==c[l]) count++; } } printf("%d\n",count); } }Problem:1054 Solution:2050444 Language:G++ Result: Others
#include<stdio.h> main() { int n; int i,j; int a[1001],b[1001]; while (scanf("%d",&n)) { if(n==0) return 0; int count =0; for(i=0;i<n;i++) { scanf("%d",&a[i]); b[i]=a[i]*a[i]; } for(j=0;j<n;j++) { for(i=0;i<n;i++) { if(a[i]==b[j]) count++; } } printf("%d\n",count); } }Problem:1054 Solution:2050422 Language:G++ Result: Wrong Answer
#include <stdio.h> int main() { int x,i,l,sum; int a[1001],b[1001]; while(scanf("%d",&x)) {if(x==0)return 0; for(i=0;i<x;i++) {scanf("%d",&a[i]); b[i]=a[i]*a[i]; } sum=0; for(i=0;i<x;i++) { for(l=0;l<x;l++) { if(a[i]==b[l]) sum++; } } printf("%d\n",sum); }}Problem:1054 Solution:2050347 Language:G++ Result: Wrong Answer
#include <stdio.h> int main() { int x,x1,i,l,sum; while(scanf("%d",&x)) {if(x==0)return 0; x1=0; int a[1001]; for(i=0;i<x;i++) {scanf("%d",&a[i]); } sum=0; for(i=0;i<=x-2;i++) { for(l=i+1;l<=x-1;l++) { if(a[i]*a[i]==a[l]||a[i]==a[l]*a[l]) sum++; } } printf("%d\n",sum); }}整数分类 Problem:1055 Solution:2050608 Language:G++ Result: Wrong Answer
#include<stdio.h> main() { int n,n1,sum; while(scanf("%d",&n)) {if(n==0)return 0; for(;n/10!=0;) { n1=n; for(sum=0;n1!=0;) { sum+=n1%10; n1=(n1-n1%10)/10; n=sum; } } printf("%d\n",n); }}日期 Problem:1103 Solution:2052014 Language:G++ Result: Wrong Answer
#include<stdio.h> int main() {int n; char a[11]; int year,month,day,x,feb; scanf("%d",&n); while(n--) { scanf("%s",a); year=1000*int(a[0]-48)+100*int(a[1]-48)+10*int(a[2]-48)+int(a[3])-48; month=10*int(a[5]-48)+int(a[6])-48; day=10*int(a[8]-48)+int(a[9])-48; x=0; while(month--) { x+=day; if((4*(year/4)==year&&100*(year/100)!=year)||(year&&100*(year/100)==year&&year&&400*(year/400)==year)) {feb=29; } else {feb=28; } if(month==1||month==3||month==5||month==7||month==8||month==10||month==12) {x+=31;break;} if(month==4||month==6||month==9||month==11) {x+=31;break; } if(month==2) {x+=feb;break; } } printf("%d\n",x); } return 0; }三角形 Problem:1148 Solution:2052399 Language:G++ Result: Wrong Answer
#include<stdio.h> int main() { int n,count,i,x; int a[101]; while(scanf("%d",&n)) {if(n==0)return 0; for(int m=0;m<n;m++) {scanf("%d",&a[m]); } for(count=n,x=n-1;count>1;count--) { for(i=0;i<x;i++) {a[i]=a[i]+a[i+1]; } x--; } printf("%d\n",a[0]%2013); } }样例都能过其中平方数出现a和b的其中抄了一道，也不能通过。 矩阵
#include <stdio.h> #define max 10 int main() { int k; scanf("%d",&k); int n=0,m=0; int x=0,y=0; char i=0; int a[max][max]={0}; int tempL,tempR,tempU,tempD; while(k--)//k次输入输出 { scanf("%d%d",&n,&m); for(int p1=0,temp=1;p1<n;p1++)//初始化数组 { for(int q1=0;q1<n;q1++,temp++) { a[p1][q1]=temp; } } while(m--)//m次执行指令 { scanf("%c",&i); scanf("%d%d",&x,&y); int l1; while(y--) { tempL=a[x-1][0]; for(l1=0;l1<n-1;l1++) { a[x-1][l1]=a[x-1][l1+1]; } a[x-1][l1]=tempL; } } int p,q; for( p=0;p<n-1;p++)//输出 { for( q=0;q<n;q++) { printf("%d ",a[p][q]); } } for( p=n-1;p<n;p++)//输出 { for( q=0;q<n-1;q++) { printf("%d ",a[p][q]); } printf("%d",a[p][q]);} printf("\n"); } return 0; } ```c #include <stdio.h> #define max 10 int main() { int k; scanf("%d",&k); int n=0,m=0; int x=0,y=0; char i=0; int a[max][max]={0}; int tempL,tempR,tempU,tempD; while(k--)//k次输入输出 { scanf("%d%d",&n,&m); for(int p1=0,temp=1;p1<n;p1++)//初始化数组 { for(int q1=0;q1<n;q1++,temp++) { a[p1][q1]=temp; } } while(m--)//m次执行指令 { scanf("%c",&i); scanf("%d%d",&x,&y); int l1; while(y--) { tempL=a[x-1][0]; for(l1=0;l1<n-1;l1++) { a[x-1][l1]=a[x-1][l1+1]; } a[x-1][l1]=tempL; } } int p,q; for( p=0;p<n-1;p++)//输出 { for( q=0;q<n;q++) { printf("%d ",a[p][q]); } } for( p=n-1;p<n;p++)//输出 { for( q=0;q<n-1;q++) { printf("%d ",a[p][q]); } printf("%d",a[p][q]);} printf("\n"); } return 0; }