1、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#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;i=0;i-)if (si=10)si-1+=si/10;si%=10;i=0;while(si=0) i+;for (;i#include#define
2、 PI 3.1415926int main()double s,a;int n;scanf(“%d %lf“,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;avoid sort(int a,int n)int i;int k;int t;for(i=1;i#includeint main()int i,j,n;for(i=1;i#include #define max(a,b) ab?a:b#define min(a,b) ab?b:aint sum1
3、01;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=10)sumlenmax-i=sumlenmax-i-10;flag=1;else flag=0;elseif(len1len2)sumlenmax-i=alen1-i-0+flag;if(sumlenmax-i=10)sumlenmax-i=sumlenmax-i-10;flag=1;else flag
4、=0;elsesumlenmax-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;i=0)sumlen1-i=alen1-i-blen2-i-flag;flag=0;elsesumlen1-i=alen1-i-blen2-i-flag+10;flag=1;elseif(alen1-i-flag-0=0)sumlen1-i=alen1-i-flag-0;flag=0;elsesumlen1-i=alen1-i-flag+10
5、-0;flag=1;for(i=0;ilen2|(len1=len2else if(strcmp(a,b)!=0)printf(“-“);jian(b,a);elseprintf(“0n“);int main()char a100,b100;gets(a);gets(b);if(a0=-jia(else if(a0=-else if(a0!=-elsecompare(a,b);return 0;大写变小写#include#includeint main()char s80;int len,i;gets(s);len=strlen(s);for(i=0;i=ascanf (“%d“,for (n
6、=1; ;n+)sum=(3*n-1)*n/2;if (summ)break;printf (“%d“,n);return 0;分数#includeint main()int k,x=1,y=1;float a,b;scanf(“%d“,for(;yint main()int n,i;for (i=0;i+) if (i%5=2break;return 0;回文字符串#include#include#include#define MAXN 5000+10char bufMAXN,sMAXN;int pMAXN;int main()int n,m=0,max=0,x,y;int i,j;fget
7、s(buf,sizeof(s),stdin);n=strlen(buf);for(i=0;i=0x=pi-j;y=pi+j;for(j=0;i-j=0x=pi-j;y=pi+j+1;for(i=x;iusing namespace std;int main()char A5000,B5000;int a=0,b,c,d,e,f,n=0,m,p,q,C5000;while(Aa=cin.get()!=n) a+;for(b=0,c=0;b=65for(a=Cp;a#includeint main()FILE*pi;pi=fopen(“in.dat“,“w“);char A1000,B1000;i
8、nt i,n;gets(A);n=strlen(A);for(i=0;iint main()int n;int i=2;int j=1;scanf(“%d“,while(1)j=j*i;if(jn) break;i+;printf(“%dn“,i-1);return 0;卡片恐怖水母#includevoid paixu(int A,int m)int i=1,n=0,j=0;for(;j=n)for(k=0;kvoid QuickSort(int A,int n,int L,int R)int i,j,t;if(L-1if(i=j)break;t=Ai;Ai=Aj;Aj=t;t=AL,AL=A
9、j,Aj=t;QuickSort(A,n,L,j-1);QuickSort(A,n,j+1,R);int main()int A1000,n,i,j,p;scanf(“%d“,if(n=1000) printf(“Overflow!“) ;return 0; /输入要排序的元素的数目，若大于 1000 则结束程序输出“Overflow!”for(i=0;i=0;i-)printf(“%d “,Ai); /输出排序好的结果return 0;两人三足#includeint main()int n,a50,i,j,t,sum=0;scanf(“%dn“,for (i=0;in;i+) scanf(“%d“,for (i=0;in;i+) for (j=0;jn-i-1;j+) if (ajaj+1) t=aj,aj=aj+1,aj+1=t;
