1:2:3#include#includeint main() int i=0,j=0,k=0,a=0,b=0,c=0,l=0,m=0,n=0,d=0,p=0,q=0; for(i=1;i=3;i+) for(j=1;j=9;j+) if(i!=j) for(k=1;k=9;k+) if(k!=j&i!=k) a=i*100+j*10+k; b=a*2; c=a*3; l=b%10,d=c%10; m=(b%100)/10,p=(c%100)/10; n=b/100,q=c/100; if(l!=0&m!=0&n!=0&d!=0&p!=0&q!=0) if(i!=l&i!=m&i!=n&j!=l&j!=m&j!=n&k!=l&k!=m&k!=n) if(i!=d&i!=p&i!=q&j!=d&j!=p&j!=q&k!=d&k!=p&k!=q) if(l!=d&l!=p&l!=q&m!=d&m!=p&m!=q&n!=d&n!=p&n!=q) printf(%d %d %dn,a,b,c); return 0;8#includestdio.hint main() int a,b10,m=0,n=0,p; int i,j,k; scanf(%d,&a); for(i=1;i=a;i+) m=0; n=0; p=i; for(j=0;p!=0;j+) bj=p%10; p=p/10; for(k=0;kj;k+) m=m+bk; if(bk=8) n=1; if(m%8=0) printf(%d ,i); continue; if(i%8=0) printf(%d ,i); continue; if(n=1) printf(%d ,i); continue; return 0;8的次数A*B#include #include #include void cheng(char a,char b) int i,j,ca,cb,*s; ca=strlen(a); cb=strlen(b); s=(int *)malloc(sizeof(int)*(ca+cb); for (i=0;ica+cb;i+) si=0; for (i=0;ica;i+) for (j=0;j=0;i-) if (si=10) si-1+=si/10; si%=10; i=0; while(si=0) i+; for (;ica+cb;i+) printf(%d,si); printf(n); free(s);int main() char a100,b100; gets(a),gets(b); if(a0=-&b0!=-) printf(-); cheng(&a1,b); else if(a0=-&b0=-) cheng(&a1,&b1); else if(a0!=-&b0=-) printf(-); cheng(a,&b1); else cheng(a,b); return 0;N边形面积#include#include#define PI 3.1415926int main()double s,a;int n;scanf(%d %lf,&n,&a);s=a*a*n/(2*2*tan(PI/n);printf(%.2lfn,s);return 0;参加竞赛#includeint main() int a,b,c,d,e; for(a=0;a2;a+) for(b=0;b2;b+) for(c=0;c2;c+) for(d=0;d2;d+) for(e=0;e2;e+) if(a=1&b=1)|(a=0&b=0) &(b=0&c=1)|(b=1&c=0) &(c=1&d=1)|(c=0&d=0) &(!(d=0&e=0) &(e=1&a=1&d=1)|(e=0) if(a=1)printf(A ); if(b=1)printf(B ); if(c=1)printf(C ); if(d=1)printf(D ); if(e=1)printf(E ); return 0;草坪喷水插入排序#includevoid sort(int a,int n)int i;int k;int t;for(i=1;in;i+)t=ai;k=i-1;while(tak)ak+1=ak;k-;if(k=-1)break;ak+1=t;int main()int n;int a100;int i;scanf(%d,&n);for(i=0;in;i+)scanf(%d,&ai);sort(a,n);printf(n);for(i=0;in;i+)if(i=n-1)printf(%dn,ai);else printf(%d ,ai);return 0;查找车牌号#include#includeint main()int i,j,n;for(i=1;i=9;i+)for(j=0;j=9;j+)for(n=33;n=100;n+)if(n*n)=(i*1100+j*11)printf(%d,i*1100+j*11);return 0;成绩转化乘完倒序尺子刻度大数除法大数减法#include #include #define max(a,b) ab?a:b#define min(a,b) ab?b:aint sum101;void jia(char a,char b) int flag=0,i,len1,len2,lenmax,lenmin; len1=strlen(a),len2=strlen(b); lenmax=max(len1,len2),lenmin=min(len1,len2); for(i=1;i=lenmax;i+) if(i=10) sumlenmax-i=sumlenmax-i-10; flag=1; else flag=0; else if(len1len2) sumlenmax-i=alen1-i-0+flag; if(sumlenmax-i=10) sumlenmax-i=sumlenmax-i-10; flag=1; else flag=0; else sumlenmax-i=blen2-i-0+flag; if(sumlenmax-i=10) sumlenmax-i=sumlenmax-i-10; flag=1; else flag=0; if(flag=1) printf(1); for(i=0;ilenmax;i+) printf(%d,sumi); printf(n);void jian(char a,char b) int flag=0,i; int len1,len2; len1=strlen(a),len2=strlen(b); for(i=1;i=len1;i+)