西工大C语言上机考试题库.docx
《西工大C语言上机考试题库.docx》由会员分享,可在线阅读,更多相关《西工大C语言上机考试题库.docx(27页珍藏版)》请在冰点文库上搜索。
1:
2:
3
#include
intmain()
{
inti=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)
=l&&i!
=m&&i!
=n&&j!
=l&&j!
=m&&j!
=n&&k!
=l&&k!
=m&&k!
=n)
=d&&i!
=p&&i!
=q&&j!
=d&&j!
=p&&j!
=q&&k!
=d&&k!
=p&&k!
=q)
=d&&l!
=p&&l!
=q&&m!
=d&&m!
=p&&m!
=q&&n!
=d&&n!
=p&&n!
printf("%d%d%d\n",a,b,c);
}
return0;
8
#include"stdio.h"
inta,b[10],m=0,n=0,p;
inti,j,k;
scanf("%d",&a);
for(i=1;i<=a;i++)
m=0;
n=0;
p=i;
for(j=0;p!
=0;j++)
b[j]=p%10;
p=p/10;
for(k=0;k{m=m+b[k];if(b[k]==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;}}return0;}8的次数A*B#include#include#includevoidcheng(chara[],charb[]){inti,j,ca,cb,*s;ca=strlen(a);cb=strlen(b);s=(int*)malloc(sizeof(int)*(ca+cb));for(i=0;ifor(i=0;ifor(j=0;js[i+j+1]+=(a[i]-'0')*(b[j]-'0');for(i=ca+cb-1;i>=0;i--)if(s[i]>=10){s[i-1]+=s[i]/10;s[i]%=10;}i=0;while(s[i]==0)i++;for(;iprintf("\n");free(s);}intmain(){chara[100],b[100];gets(a),gets(b);if(a[0]=='-'&&b[0]!='-'){printf("-");cheng(&a[1],b);}elseif(a[0]=='-'&&b[0]=='-'){cheng(&a[1],&b[1]);}elseif(a[0]!='-'&&b[0]=='-'){printf("-");cheng(a,&b[1]);}elsecheng(a,b);return0;}N边形面积#include#include#definePI3.1415926intmain(){doubles,a;intn;scanf("%d%lf",&n,&a);s=a*a*n/(2*2*tan(PI/n));printf("%.2lf\n",s);return0;}参加竞赛#includeintmain(){inta,b,c,d,e;for(a=0;a<2;a++)for(b=0;b<2;b++)for(c=0;c<2;c++)for(d=0;d<2;d++)for(e=0;e<2;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");}}return0;}草坪喷水插入排序#includevoidsort(inta[],intn){ inti; intk; intt; for(i=1;i { t=a[i]; k=i-1; while(t a[k+1]=a[k]; k--; if(k==-1)break; } a[k+1]=t; }}intmain(){ intn; inta[100]; inti; scanf("%d",&n); for(i=0;i scanf("%d",&a[i]); sort(a,n); printf("\n"); for(i=0;i if(i==n-1) printf("%d\n",a[i]); elseprintf("%d",a[i]);return0;}查找车牌号#include#includeintmain(){ inti,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); } } } return0;}成绩转化乘完倒序尺子刻度大数除法大数减法#include#include#definemax(a,b)a>b?a:b#definemin(a,b)a>b?b:aintsum[101];voidjia(chara[],charb[]){intflag=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<=lenmin){sum[lenmax-i]=a[len1-i]+b[len2-i]-'0'-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}else{if(len1>len2){sum[lenmax-i]=a[len1-i]-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}else{sum[lenmax-i]=b[len2-i]-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}}}if(flag==1)printf("1");for(i=0;iprintf("%d",sum[i]);printf("\n");}voidjian(chara[],charb[]){intflag=0,i;intlen1,len2;len1=strlen(a),len2=strlen(b);for(i=1;i<=len1;i++){if(i<=len2){if(a[len1-i]-b[len2-i]-flag>=0){sum[len1-i]=a[len1-i]-b[len2-i]-flag;flag=0;}else{sum[len1-i]=a[len1-i]-b[len2-i]-flag+10;flag=1;}}else{if(a[len1-i]-flag-'0'>=0){sum[len1-i]=a[len1-i]-flag-'0';flag=0;}else{sum[len1-i]=a[len1-i]-flag+10-'0';flag=1;}}}for(i=0;ifor(;iprintf("%d",sum[i]);printf("\n");}voidcompare(chara[],charb[]){intlen1,len2;len1=strlen(a),len2=strlen(b);if(len1>len2||(len1==len2&&strcmp(a,b)>0))jian(a,b);elseif(strcmp(a,b)!=0){printf("-");jian(b,a);}elseprintf("0\n");}intmain(){chara[100],b[100];gets(a);gets(b);if(a[0]=='-'&&b[0]!='-'){printf("-");jia(&a[1],b);}elseif(a[0]=='-'&&b[0]=='-')compare(&b[1],&a[1]);elseif(a[0]!='-'&&b[0]=='-')jia(a,&b[1]);elsecompare(a,b);return0;}大写变小写#include#includeintmain(){chars[80];intlen,i;gets(s);len=strlen(s);for(i=0;i{if(s[i]>='a'&&s[i]<='z')s[i]=s[i]-32; }puts(s);return0;}到底星期几等比数列#include#includeintmain(){intm,n,sum;scanf("%d",&m);for(n=1;;n++){sum=(3*n-1)*n/2;if(sum>m)break;}printf("%d",n);return0;}分数#includeintmain(){ intk,x=1,y=1; floata,b; scanf("%d",&k); for(;y<=5000;y++){ for(x=y;x<=5000;x++){ a=1.0/k;b=1.0/x+1.0/y; if(a==b)printf("1/%d=1/%d+1/%d\n",k,x,y); } } return0;}韩信点兵#includeintmain(){ intn,i; for(i=0;;i++){ if(i%5==2&&i%6==3&&i%7==4&&i%11==5){printf("%d",i);break;} } return0;}回文字符串#include#include#include#defineMAXN5000+10charbuf[MAXN],s[MAXN];intp[MAXN];intmain(){intn,m=0,max=0,x,y;inti,j;fgets(buf,sizeof(s),stdin);n=strlen(buf);for(i=0;i{if(isalpha(buf[i])){p[m]=i;s[m++]=toupper(buf[i]);}}for(i=0;i{for(j=0;i-j>=0&&i+j{if(s[i-j]!=s[i+j])break;if(j*2+1>max){max=j*2+1;x=p[i-j];y=p[i+j];}}for(j=0;i-j>=0&&i+j+1{if(s[i-j]!=s[i+j+1])break;if(j*2+2>max){max=j*2+2;x=p[i-j];y=p[i+j+1];}}}for(i=x;i<=y;i++)printf("%c",buf[i]);printf("\n");return0;}#includeusingnamespacestd;intmain(){charA[5000],B[5000];inta=0,b,c,d,e,f,n=0,m,p,q,C[5000];while((A[a]=cin.get())!='\n')a++;for(b=0,c=0;b<=a-1;b++){if((A[b]>=65&&A[b]<=90)||(A[b]>=97&&A[b]<=122)){B[c]=A[b],C[c]=b;if(B[c]>=97&&B[c]<=122)B[c]=B[c]-32;c++;}}B[c]=32;for(d=0;d<=c-2;d++){if(B[d]==B[d+1])e=d,f=d+1,a=1;elseif(B[d]==B[d+2])e=d,f=d+2,a=1;elsecontinue;while(e-1>=0&&f+1<=c&&B[e-1]==B[f+1])e--,f++;m=f-e;if(m>n)n=m,p=e,q=f;}for(a=C[p];a<=C[q];a++)cout<cout<}鸡的体重计算数据整数部分加密#include#includeintmain(){ FILE*pi; pi=fopen("in.dat","w"); charA[1000],B[1000]; inti,n; gets(A); n=strlen(A); for(i=0;i fprintf(pi,"%c",A[i]); if('A'<=A[i]<'Z'||'a'<=A[i]<'z') B[i]=A[i]+1; if(A[i]=='Z'||A[i]=='z') B[i]=A[i]-25; } for(i=0;i printf("%c",B[i]); fclose(pi); return0;}阶乘#includeintmain(){intn;inti=2;intj=1;scanf("%d",&n);while(1){j=j*i;if(j>n)break;i++;}printf("%d\n",i-1);return0;}卡片恐怖水母#includevoidpaixu(intA[],intm){inti=1,n=0,j=0;for(;j{for(i=j+1;i{if(A[i]{n=A[j];A[j]=A[i];A[i]=n;}}}}intmain(){intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;scanf("%d%d",&n,&m);for(i=0;i{scanf("%d",&A[i]);}for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
{m=m+b[k];
if(b[k]==8)
{n=1;
if(m%8==0)
{printf("%d",i);
continue;}
if(i%8==0)
if(n==1)
8的次数
A*B
voidcheng(chara[],charb[])
inti,j,ca,cb,*s;
ca=strlen(a);
cb=strlen(b);
s=(int*)malloc(sizeof(int)*(ca+cb));
for(i=0;ifor(i=0;ifor(j=0;js[i+j+1]+=(a[i]-'0')*(b[j]-'0');for(i=ca+cb-1;i>=0;i--)if(s[i]>=10){s[i-1]+=s[i]/10;s[i]%=10;}i=0;while(s[i]==0)i++;for(;iprintf("\n");free(s);}intmain(){chara[100],b[100];gets(a),gets(b);if(a[0]=='-'&&b[0]!='-'){printf("-");cheng(&a[1],b);}elseif(a[0]=='-'&&b[0]=='-'){cheng(&a[1],&b[1]);}elseif(a[0]!='-'&&b[0]=='-'){printf("-");cheng(a,&b[1]);}elsecheng(a,b);return0;}N边形面积#include#include#definePI3.1415926intmain(){doubles,a;intn;scanf("%d%lf",&n,&a);s=a*a*n/(2*2*tan(PI/n));printf("%.2lf\n",s);return0;}参加竞赛#includeintmain(){inta,b,c,d,e;for(a=0;a<2;a++)for(b=0;b<2;b++)for(c=0;c<2;c++)for(d=0;d<2;d++)for(e=0;e<2;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");}}return0;}草坪喷水插入排序#includevoidsort(inta[],intn){ inti; intk; intt; for(i=1;i { t=a[i]; k=i-1; while(t a[k+1]=a[k]; k--; if(k==-1)break; } a[k+1]=t; }}intmain(){ intn; inta[100]; inti; scanf("%d",&n); for(i=0;i scanf("%d",&a[i]); sort(a,n); printf("\n"); for(i=0;i if(i==n-1) printf("%d\n",a[i]); elseprintf("%d",a[i]);return0;}查找车牌号#include#includeintmain(){ inti,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); } } } return0;}成绩转化乘完倒序尺子刻度大数除法大数减法#include#include#definemax(a,b)a>b?a:b#definemin(a,b)a>b?b:aintsum[101];voidjia(chara[],charb[]){intflag=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<=lenmin){sum[lenmax-i]=a[len1-i]+b[len2-i]-'0'-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}else{if(len1>len2){sum[lenmax-i]=a[len1-i]-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}else{sum[lenmax-i]=b[len2-i]-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}}}if(flag==1)printf("1");for(i=0;iprintf("%d",sum[i]);printf("\n");}voidjian(chara[],charb[]){intflag=0,i;intlen1,len2;len1=strlen(a),len2=strlen(b);for(i=1;i<=len1;i++){if(i<=len2){if(a[len1-i]-b[len2-i]-flag>=0){sum[len1-i]=a[len1-i]-b[len2-i]-flag;flag=0;}else{sum[len1-i]=a[len1-i]-b[len2-i]-flag+10;flag=1;}}else{if(a[len1-i]-flag-'0'>=0){sum[len1-i]=a[len1-i]-flag-'0';flag=0;}else{sum[len1-i]=a[len1-i]-flag+10-'0';flag=1;}}}for(i=0;ifor(;iprintf("%d",sum[i]);printf("\n");}voidcompare(chara[],charb[]){intlen1,len2;len1=strlen(a),len2=strlen(b);if(len1>len2||(len1==len2&&strcmp(a,b)>0))jian(a,b);elseif(strcmp(a,b)!=0){printf("-");jian(b,a);}elseprintf("0\n");}intmain(){chara[100],b[100];gets(a);gets(b);if(a[0]=='-'&&b[0]!='-'){printf("-");jia(&a[1],b);}elseif(a[0]=='-'&&b[0]=='-')compare(&b[1],&a[1]);elseif(a[0]!='-'&&b[0]=='-')jia(a,&b[1]);elsecompare(a,b);return0;}大写变小写#include#includeintmain(){chars[80];intlen,i;gets(s);len=strlen(s);for(i=0;i{if(s[i]>='a'&&s[i]<='z')s[i]=s[i]-32; }puts(s);return0;}到底星期几等比数列#include#includeintmain(){intm,n,sum;scanf("%d",&m);for(n=1;;n++){sum=(3*n-1)*n/2;if(sum>m)break;}printf("%d",n);return0;}分数#includeintmain(){ intk,x=1,y=1; floata,b; scanf("%d",&k); for(;y<=5000;y++){ for(x=y;x<=5000;x++){ a=1.0/k;b=1.0/x+1.0/y; if(a==b)printf("1/%d=1/%d+1/%d\n",k,x,y); } } return0;}韩信点兵#includeintmain(){ intn,i; for(i=0;;i++){ if(i%5==2&&i%6==3&&i%7==4&&i%11==5){printf("%d",i);break;} } return0;}回文字符串#include#include#include#defineMAXN5000+10charbuf[MAXN],s[MAXN];intp[MAXN];intmain(){intn,m=0,max=0,x,y;inti,j;fgets(buf,sizeof(s),stdin);n=strlen(buf);for(i=0;i{if(isalpha(buf[i])){p[m]=i;s[m++]=toupper(buf[i]);}}for(i=0;i{for(j=0;i-j>=0&&i+j{if(s[i-j]!=s[i+j])break;if(j*2+1>max){max=j*2+1;x=p[i-j];y=p[i+j];}}for(j=0;i-j>=0&&i+j+1{if(s[i-j]!=s[i+j+1])break;if(j*2+2>max){max=j*2+2;x=p[i-j];y=p[i+j+1];}}}for(i=x;i<=y;i++)printf("%c",buf[i]);printf("\n");return0;}#includeusingnamespacestd;intmain(){charA[5000],B[5000];inta=0,b,c,d,e,f,n=0,m,p,q,C[5000];while((A[a]=cin.get())!='\n')a++;for(b=0,c=0;b<=a-1;b++){if((A[b]>=65&&A[b]<=90)||(A[b]>=97&&A[b]<=122)){B[c]=A[b],C[c]=b;if(B[c]>=97&&B[c]<=122)B[c]=B[c]-32;c++;}}B[c]=32;for(d=0;d<=c-2;d++){if(B[d]==B[d+1])e=d,f=d+1,a=1;elseif(B[d]==B[d+2])e=d,f=d+2,a=1;elsecontinue;while(e-1>=0&&f+1<=c&&B[e-1]==B[f+1])e--,f++;m=f-e;if(m>n)n=m,p=e,q=f;}for(a=C[p];a<=C[q];a++)cout<cout<}鸡的体重计算数据整数部分加密#include#includeintmain(){ FILE*pi; pi=fopen("in.dat","w"); charA[1000],B[1000]; inti,n; gets(A); n=strlen(A); for(i=0;i fprintf(pi,"%c",A[i]); if('A'<=A[i]<'Z'||'a'<=A[i]<'z') B[i]=A[i]+1; if(A[i]=='Z'||A[i]=='z') B[i]=A[i]-25; } for(i=0;i printf("%c",B[i]); fclose(pi); return0;}阶乘#includeintmain(){intn;inti=2;intj=1;scanf("%d",&n);while(1){j=j*i;if(j>n)break;i++;}printf("%d\n",i-1);return0;}卡片恐怖水母#includevoidpaixu(intA[],intm){inti=1,n=0,j=0;for(;j{for(i=j+1;i{if(A[i]{n=A[j];A[j]=A[i];A[i]=n;}}}}intmain(){intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;scanf("%d%d",&n,&m);for(i=0;i{scanf("%d",&A[i]);}for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
for(i=0;ifor(j=0;js[i+j+1]+=(a[i]-'0')*(b[j]-'0');for(i=ca+cb-1;i>=0;i--)if(s[i]>=10){s[i-1]+=s[i]/10;s[i]%=10;}i=0;while(s[i]==0)i++;for(;iprintf("\n");free(s);}intmain(){chara[100],b[100];gets(a),gets(b);if(a[0]=='-'&&b[0]!='-'){printf("-");cheng(&a[1],b);}elseif(a[0]=='-'&&b[0]=='-'){cheng(&a[1],&b[1]);}elseif(a[0]!='-'&&b[0]=='-'){printf("-");cheng(a,&b[1]);}elsecheng(a,b);return0;}N边形面积#include#include#definePI3.1415926intmain(){doubles,a;intn;scanf("%d%lf",&n,&a);s=a*a*n/(2*2*tan(PI/n));printf("%.2lf\n",s);return0;}参加竞赛#includeintmain(){inta,b,c,d,e;for(a=0;a<2;a++)for(b=0;b<2;b++)for(c=0;c<2;c++)for(d=0;d<2;d++)for(e=0;e<2;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");}}return0;}草坪喷水插入排序#includevoidsort(inta[],intn){ inti; intk; intt; for(i=1;i { t=a[i]; k=i-1; while(t a[k+1]=a[k]; k--; if(k==-1)break; } a[k+1]=t; }}intmain(){ intn; inta[100]; inti; scanf("%d",&n); for(i=0;i scanf("%d",&a[i]); sort(a,n); printf("\n"); for(i=0;i if(i==n-1) printf("%d\n",a[i]); elseprintf("%d",a[i]);return0;}查找车牌号#include#includeintmain(){ inti,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); } } } return0;}成绩转化乘完倒序尺子刻度大数除法大数减法#include#include#definemax(a,b)a>b?a:b#definemin(a,b)a>b?b:aintsum[101];voidjia(chara[],charb[]){intflag=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<=lenmin){sum[lenmax-i]=a[len1-i]+b[len2-i]-'0'-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}else{if(len1>len2){sum[lenmax-i]=a[len1-i]-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}else{sum[lenmax-i]=b[len2-i]-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}}}if(flag==1)printf("1");for(i=0;iprintf("%d",sum[i]);printf("\n");}voidjian(chara[],charb[]){intflag=0,i;intlen1,len2;len1=strlen(a),len2=strlen(b);for(i=1;i<=len1;i++){if(i<=len2){if(a[len1-i]-b[len2-i]-flag>=0){sum[len1-i]=a[len1-i]-b[len2-i]-flag;flag=0;}else{sum[len1-i]=a[len1-i]-b[len2-i]-flag+10;flag=1;}}else{if(a[len1-i]-flag-'0'>=0){sum[len1-i]=a[len1-i]-flag-'0';flag=0;}else{sum[len1-i]=a[len1-i]-flag+10-'0';flag=1;}}}for(i=0;ifor(;iprintf("%d",sum[i]);printf("\n");}voidcompare(chara[],charb[]){intlen1,len2;len1=strlen(a),len2=strlen(b);if(len1>len2||(len1==len2&&strcmp(a,b)>0))jian(a,b);elseif(strcmp(a,b)!=0){printf("-");jian(b,a);}elseprintf("0\n");}intmain(){chara[100],b[100];gets(a);gets(b);if(a[0]=='-'&&b[0]!='-'){printf("-");jia(&a[1],b);}elseif(a[0]=='-'&&b[0]=='-')compare(&b[1],&a[1]);elseif(a[0]!='-'&&b[0]=='-')jia(a,&b[1]);elsecompare(a,b);return0;}大写变小写#include#includeintmain(){chars[80];intlen,i;gets(s);len=strlen(s);for(i=0;i{if(s[i]>='a'&&s[i]<='z')s[i]=s[i]-32; }puts(s);return0;}到底星期几等比数列#include#includeintmain(){intm,n,sum;scanf("%d",&m);for(n=1;;n++){sum=(3*n-1)*n/2;if(sum>m)break;}printf("%d",n);return0;}分数#includeintmain(){ intk,x=1,y=1; floata,b; scanf("%d",&k); for(;y<=5000;y++){ for(x=y;x<=5000;x++){ a=1.0/k;b=1.0/x+1.0/y; if(a==b)printf("1/%d=1/%d+1/%d\n",k,x,y); } } return0;}韩信点兵#includeintmain(){ intn,i; for(i=0;;i++){ if(i%5==2&&i%6==3&&i%7==4&&i%11==5){printf("%d",i);break;} } return0;}回文字符串#include#include#include#defineMAXN5000+10charbuf[MAXN],s[MAXN];intp[MAXN];intmain(){intn,m=0,max=0,x,y;inti,j;fgets(buf,sizeof(s),stdin);n=strlen(buf);for(i=0;i{if(isalpha(buf[i])){p[m]=i;s[m++]=toupper(buf[i]);}}for(i=0;i{for(j=0;i-j>=0&&i+j{if(s[i-j]!=s[i+j])break;if(j*2+1>max){max=j*2+1;x=p[i-j];y=p[i+j];}}for(j=0;i-j>=0&&i+j+1{if(s[i-j]!=s[i+j+1])break;if(j*2+2>max){max=j*2+2;x=p[i-j];y=p[i+j+1];}}}for(i=x;i<=y;i++)printf("%c",buf[i]);printf("\n");return0;}#includeusingnamespacestd;intmain(){charA[5000],B[5000];inta=0,b,c,d,e,f,n=0,m,p,q,C[5000];while((A[a]=cin.get())!='\n')a++;for(b=0,c=0;b<=a-1;b++){if((A[b]>=65&&A[b]<=90)||(A[b]>=97&&A[b]<=122)){B[c]=A[b],C[c]=b;if(B[c]>=97&&B[c]<=122)B[c]=B[c]-32;c++;}}B[c]=32;for(d=0;d<=c-2;d++){if(B[d]==B[d+1])e=d,f=d+1,a=1;elseif(B[d]==B[d+2])e=d,f=d+2,a=1;elsecontinue;while(e-1>=0&&f+1<=c&&B[e-1]==B[f+1])e--,f++;m=f-e;if(m>n)n=m,p=e,q=f;}for(a=C[p];a<=C[q];a++)cout<cout<}鸡的体重计算数据整数部分加密#include#includeintmain(){ FILE*pi; pi=fopen("in.dat","w"); charA[1000],B[1000]; inti,n; gets(A); n=strlen(A); for(i=0;i fprintf(pi,"%c",A[i]); if('A'<=A[i]<'Z'||'a'<=A[i]<'z') B[i]=A[i]+1; if(A[i]=='Z'||A[i]=='z') B[i]=A[i]-25; } for(i=0;i printf("%c",B[i]); fclose(pi); return0;}阶乘#includeintmain(){intn;inti=2;intj=1;scanf("%d",&n);while(1){j=j*i;if(j>n)break;i++;}printf("%d\n",i-1);return0;}卡片恐怖水母#includevoidpaixu(intA[],intm){inti=1,n=0,j=0;for(;j{for(i=j+1;i{if(A[i]{n=A[j];A[j]=A[i];A[i]=n;}}}}intmain(){intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;scanf("%d%d",&n,&m);for(i=0;i{scanf("%d",&A[i]);}for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
for(j=0;js[i+j+1]+=(a[i]-'0')*(b[j]-'0');for(i=ca+cb-1;i>=0;i--)if(s[i]>=10){s[i-1]+=s[i]/10;s[i]%=10;}i=0;while(s[i]==0)i++;for(;iprintf("\n");free(s);}intmain(){chara[100],b[100];gets(a),gets(b);if(a[0]=='-'&&b[0]!='-'){printf("-");cheng(&a[1],b);}elseif(a[0]=='-'&&b[0]=='-'){cheng(&a[1],&b[1]);}elseif(a[0]!='-'&&b[0]=='-'){printf("-");cheng(a,&b[1]);}elsecheng(a,b);return0;}N边形面积#include#include#definePI3.1415926intmain(){doubles,a;intn;scanf("%d%lf",&n,&a);s=a*a*n/(2*2*tan(PI/n));printf("%.2lf\n",s);return0;}参加竞赛#includeintmain(){inta,b,c,d,e;for(a=0;a<2;a++)for(b=0;b<2;b++)for(c=0;c<2;c++)for(d=0;d<2;d++)for(e=0;e<2;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");}}return0;}草坪喷水插入排序#includevoidsort(inta[],intn){ inti; intk; intt; for(i=1;i { t=a[i]; k=i-1; while(t a[k+1]=a[k]; k--; if(k==-1)break; } a[k+1]=t; }}intmain(){ intn; inta[100]; inti; scanf("%d",&n); for(i=0;i scanf("%d",&a[i]); sort(a,n); printf("\n"); for(i=0;i if(i==n-1) printf("%d\n",a[i]); elseprintf("%d",a[i]);return0;}查找车牌号#include#includeintmain(){ inti,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); } } } return0;}成绩转化乘完倒序尺子刻度大数除法大数减法#include#include#definemax(a,b)a>b?a:b#definemin(a,b)a>b?b:aintsum[101];voidjia(chara[],charb[]){intflag=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<=lenmin){sum[lenmax-i]=a[len1-i]+b[len2-i]-'0'-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}else{if(len1>len2){sum[lenmax-i]=a[len1-i]-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}else{sum[lenmax-i]=b[len2-i]-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}}}if(flag==1)printf("1");for(i=0;iprintf("%d",sum[i]);printf("\n");}voidjian(chara[],charb[]){intflag=0,i;intlen1,len2;len1=strlen(a),len2=strlen(b);for(i=1;i<=len1;i++){if(i<=len2){if(a[len1-i]-b[len2-i]-flag>=0){sum[len1-i]=a[len1-i]-b[len2-i]-flag;flag=0;}else{sum[len1-i]=a[len1-i]-b[len2-i]-flag+10;flag=1;}}else{if(a[len1-i]-flag-'0'>=0){sum[len1-i]=a[len1-i]-flag-'0';flag=0;}else{sum[len1-i]=a[len1-i]-flag+10-'0';flag=1;}}}for(i=0;ifor(;iprintf("%d",sum[i]);printf("\n");}voidcompare(chara[],charb[]){intlen1,len2;len1=strlen(a),len2=strlen(b);if(len1>len2||(len1==len2&&strcmp(a,b)>0))jian(a,b);elseif(strcmp(a,b)!=0){printf("-");jian(b,a);}elseprintf("0\n");}intmain(){chara[100],b[100];gets(a);gets(b);if(a[0]=='-'&&b[0]!='-'){printf("-");jia(&a[1],b);}elseif(a[0]=='-'&&b[0]=='-')compare(&b[1],&a[1]);elseif(a[0]!='-'&&b[0]=='-')jia(a,&b[1]);elsecompare(a,b);return0;}大写变小写#include#includeintmain(){chars[80];intlen,i;gets(s);len=strlen(s);for(i=0;i{if(s[i]>='a'&&s[i]<='z')s[i]=s[i]-32; }puts(s);return0;}到底星期几等比数列#include#includeintmain(){intm,n,sum;scanf("%d",&m);for(n=1;;n++){sum=(3*n-1)*n/2;if(sum>m)break;}printf("%d",n);return0;}分数#includeintmain(){ intk,x=1,y=1; floata,b; scanf("%d",&k); for(;y<=5000;y++){ for(x=y;x<=5000;x++){ a=1.0/k;b=1.0/x+1.0/y; if(a==b)printf("1/%d=1/%d+1/%d\n",k,x,y); } } return0;}韩信点兵#includeintmain(){ intn,i; for(i=0;;i++){ if(i%5==2&&i%6==3&&i%7==4&&i%11==5){printf("%d",i);break;} } return0;}回文字符串#include#include#include#defineMAXN5000+10charbuf[MAXN],s[MAXN];intp[MAXN];intmain(){intn,m=0,max=0,x,y;inti,j;fgets(buf,sizeof(s),stdin);n=strlen(buf);for(i=0;i{if(isalpha(buf[i])){p[m]=i;s[m++]=toupper(buf[i]);}}for(i=0;i{for(j=0;i-j>=0&&i+j{if(s[i-j]!=s[i+j])break;if(j*2+1>max){max=j*2+1;x=p[i-j];y=p[i+j];}}for(j=0;i-j>=0&&i+j+1{if(s[i-j]!=s[i+j+1])break;if(j*2+2>max){max=j*2+2;x=p[i-j];y=p[i+j+1];}}}for(i=x;i<=y;i++)printf("%c",buf[i]);printf("\n");return0;}#includeusingnamespacestd;intmain(){charA[5000],B[5000];inta=0,b,c,d,e,f,n=0,m,p,q,C[5000];while((A[a]=cin.get())!='\n')a++;for(b=0,c=0;b<=a-1;b++){if((A[b]>=65&&A[b]<=90)||(A[b]>=97&&A[b]<=122)){B[c]=A[b],C[c]=b;if(B[c]>=97&&B[c]<=122)B[c]=B[c]-32;c++;}}B[c]=32;for(d=0;d<=c-2;d++){if(B[d]==B[d+1])e=d,f=d+1,a=1;elseif(B[d]==B[d+2])e=d,f=d+2,a=1;elsecontinue;while(e-1>=0&&f+1<=c&&B[e-1]==B[f+1])e--,f++;m=f-e;if(m>n)n=m,p=e,q=f;}for(a=C[p];a<=C[q];a++)cout<cout<}鸡的体重计算数据整数部分加密#include#includeintmain(){ FILE*pi; pi=fopen("in.dat","w"); charA[1000],B[1000]; inti,n; gets(A); n=strlen(A); for(i=0;i fprintf(pi,"%c",A[i]); if('A'<=A[i]<'Z'||'a'<=A[i]<'z') B[i]=A[i]+1; if(A[i]=='Z'||A[i]=='z') B[i]=A[i]-25; } for(i=0;i printf("%c",B[i]); fclose(pi); return0;}阶乘#includeintmain(){intn;inti=2;intj=1;scanf("%d",&n);while(1){j=j*i;if(j>n)break;i++;}printf("%d\n",i-1);return0;}卡片恐怖水母#includevoidpaixu(intA[],intm){inti=1,n=0,j=0;for(;j{for(i=j+1;i{if(A[i]{n=A[j];A[j]=A[i];A[i]=n;}}}}intmain(){intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;scanf("%d%d",&n,&m);for(i=0;i{scanf("%d",&A[i]);}for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
s[i+j+1]+=(a[i]-'0')*(b[j]-'0');
for(i=ca+cb-1;i>=0;i--)
if(s[i]>=10)
s[i-1]+=s[i]/10;
s[i]%=10;
i=0;
while(s[i]==0)i++;
for(;iprintf("\n");free(s);}intmain(){chara[100],b[100];gets(a),gets(b);if(a[0]=='-'&&b[0]!='-'){printf("-");cheng(&a[1],b);}elseif(a[0]=='-'&&b[0]=='-'){cheng(&a[1],&b[1]);}elseif(a[0]!='-'&&b[0]=='-'){printf("-");cheng(a,&b[1]);}elsecheng(a,b);return0;}N边形面积#include#include#definePI3.1415926intmain(){doubles,a;intn;scanf("%d%lf",&n,&a);s=a*a*n/(2*2*tan(PI/n));printf("%.2lf\n",s);return0;}参加竞赛#includeintmain(){inta,b,c,d,e;for(a=0;a<2;a++)for(b=0;b<2;b++)for(c=0;c<2;c++)for(d=0;d<2;d++)for(e=0;e<2;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");}}return0;}草坪喷水插入排序#includevoidsort(inta[],intn){ inti; intk; intt; for(i=1;i { t=a[i]; k=i-1; while(t a[k+1]=a[k]; k--; if(k==-1)break; } a[k+1]=t; }}intmain(){ intn; inta[100]; inti; scanf("%d",&n); for(i=0;i scanf("%d",&a[i]); sort(a,n); printf("\n"); for(i=0;i if(i==n-1) printf("%d\n",a[i]); elseprintf("%d",a[i]);return0;}查找车牌号#include#includeintmain(){ inti,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); } } } return0;}成绩转化乘完倒序尺子刻度大数除法大数减法#include#include#definemax(a,b)a>b?a:b#definemin(a,b)a>b?b:aintsum[101];voidjia(chara[],charb[]){intflag=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<=lenmin){sum[lenmax-i]=a[len1-i]+b[len2-i]-'0'-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}else{if(len1>len2){sum[lenmax-i]=a[len1-i]-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}else{sum[lenmax-i]=b[len2-i]-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}}}if(flag==1)printf("1");for(i=0;iprintf("%d",sum[i]);printf("\n");}voidjian(chara[],charb[]){intflag=0,i;intlen1,len2;len1=strlen(a),len2=strlen(b);for(i=1;i<=len1;i++){if(i<=len2){if(a[len1-i]-b[len2-i]-flag>=0){sum[len1-i]=a[len1-i]-b[len2-i]-flag;flag=0;}else{sum[len1-i]=a[len1-i]-b[len2-i]-flag+10;flag=1;}}else{if(a[len1-i]-flag-'0'>=0){sum[len1-i]=a[len1-i]-flag-'0';flag=0;}else{sum[len1-i]=a[len1-i]-flag+10-'0';flag=1;}}}for(i=0;ifor(;iprintf("%d",sum[i]);printf("\n");}voidcompare(chara[],charb[]){intlen1,len2;len1=strlen(a),len2=strlen(b);if(len1>len2||(len1==len2&&strcmp(a,b)>0))jian(a,b);elseif(strcmp(a,b)!=0){printf("-");jian(b,a);}elseprintf("0\n");}intmain(){chara[100],b[100];gets(a);gets(b);if(a[0]=='-'&&b[0]!='-'){printf("-");jia(&a[1],b);}elseif(a[0]=='-'&&b[0]=='-')compare(&b[1],&a[1]);elseif(a[0]!='-'&&b[0]=='-')jia(a,&b[1]);elsecompare(a,b);return0;}大写变小写#include#includeintmain(){chars[80];intlen,i;gets(s);len=strlen(s);for(i=0;i{if(s[i]>='a'&&s[i]<='z')s[i]=s[i]-32; }puts(s);return0;}到底星期几等比数列#include#includeintmain(){intm,n,sum;scanf("%d",&m);for(n=1;;n++){sum=(3*n-1)*n/2;if(sum>m)break;}printf("%d",n);return0;}分数#includeintmain(){ intk,x=1,y=1; floata,b; scanf("%d",&k); for(;y<=5000;y++){ for(x=y;x<=5000;x++){ a=1.0/k;b=1.0/x+1.0/y; if(a==b)printf("1/%d=1/%d+1/%d\n",k,x,y); } } return0;}韩信点兵#includeintmain(){ intn,i; for(i=0;;i++){ if(i%5==2&&i%6==3&&i%7==4&&i%11==5){printf("%d",i);break;} } return0;}回文字符串#include#include#include#defineMAXN5000+10charbuf[MAXN],s[MAXN];intp[MAXN];intmain(){intn,m=0,max=0,x,y;inti,j;fgets(buf,sizeof(s),stdin);n=strlen(buf);for(i=0;i{if(isalpha(buf[i])){p[m]=i;s[m++]=toupper(buf[i]);}}for(i=0;i{for(j=0;i-j>=0&&i+j{if(s[i-j]!=s[i+j])break;if(j*2+1>max){max=j*2+1;x=p[i-j];y=p[i+j];}}for(j=0;i-j>=0&&i+j+1{if(s[i-j]!=s[i+j+1])break;if(j*2+2>max){max=j*2+2;x=p[i-j];y=p[i+j+1];}}}for(i=x;i<=y;i++)printf("%c",buf[i]);printf("\n");return0;}#includeusingnamespacestd;intmain(){charA[5000],B[5000];inta=0,b,c,d,e,f,n=0,m,p,q,C[5000];while((A[a]=cin.get())!='\n')a++;for(b=0,c=0;b<=a-1;b++){if((A[b]>=65&&A[b]<=90)||(A[b]>=97&&A[b]<=122)){B[c]=A[b],C[c]=b;if(B[c]>=97&&B[c]<=122)B[c]=B[c]-32;c++;}}B[c]=32;for(d=0;d<=c-2;d++){if(B[d]==B[d+1])e=d,f=d+1,a=1;elseif(B[d]==B[d+2])e=d,f=d+2,a=1;elsecontinue;while(e-1>=0&&f+1<=c&&B[e-1]==B[f+1])e--,f++;m=f-e;if(m>n)n=m,p=e,q=f;}for(a=C[p];a<=C[q];a++)cout<cout<}鸡的体重计算数据整数部分加密#include#includeintmain(){ FILE*pi; pi=fopen("in.dat","w"); charA[1000],B[1000]; inti,n; gets(A); n=strlen(A); for(i=0;i fprintf(pi,"%c",A[i]); if('A'<=A[i]<'Z'||'a'<=A[i]<'z') B[i]=A[i]+1; if(A[i]=='Z'||A[i]=='z') B[i]=A[i]-25; } for(i=0;i printf("%c",B[i]); fclose(pi); return0;}阶乘#includeintmain(){intn;inti=2;intj=1;scanf("%d",&n);while(1){j=j*i;if(j>n)break;i++;}printf("%d\n",i-1);return0;}卡片恐怖水母#includevoidpaixu(intA[],intm){inti=1,n=0,j=0;for(;j{for(i=j+1;i{if(A[i]{n=A[j];A[j]=A[i];A[i]=n;}}}}intmain(){intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;scanf("%d%d",&n,&m);for(i=0;i{scanf("%d",&A[i]);}for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
printf("\n");
free(s);
chara[100],b[100];
gets(a),gets(b);
if(a[0]=='-'&&b[0]!
='-')
printf("-");
cheng(&a[1],b);
elseif(a[0]=='-'&&b[0]=='-')
cheng(&a[1],&b[1]);
elseif(a[0]!
='-'&&b[0]=='-')
cheng(a,&b[1]);
else
cheng(a,b);
N边形面积
#definePI3.1415926
doubles,a;
intn;
scanf("%d%lf",&n,&a);
s=a*a*n/(2*2*tan(PI/n));
printf("%.2lf\n",s);
参加竞赛
inta,b,c,d,e;
for(a=0;a<2;a++)
for(b=0;b<2;b++)
for(c=0;c<2;c++)
for(d=0;d<2;d++)
for(e=0;e<2;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");}}
草坪喷水
插入排序
voidsort(inta[],intn)
inti;
intk;
intt;
for(i=1;i { t=a[i]; k=i-1; while(t a[k+1]=a[k]; k--; if(k==-1)break; } a[k+1]=t; }}intmain(){ intn; inta[100]; inti; scanf("%d",&n); for(i=0;i scanf("%d",&a[i]); sort(a,n); printf("\n"); for(i=0;i if(i==n-1) printf("%d\n",a[i]); elseprintf("%d",a[i]);return0;}查找车牌号#include#includeintmain(){ inti,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); } } } return0;}成绩转化乘完倒序尺子刻度大数除法大数减法#include#include#definemax(a,b)a>b?a:b#definemin(a,b)a>b?b:aintsum[101];voidjia(chara[],charb[]){intflag=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<=lenmin){sum[lenmax-i]=a[len1-i]+b[len2-i]-'0'-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}else{if(len1>len2){sum[lenmax-i]=a[len1-i]-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}else{sum[lenmax-i]=b[len2-i]-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}}}if(flag==1)printf("1");for(i=0;iprintf("%d",sum[i]);printf("\n");}voidjian(chara[],charb[]){intflag=0,i;intlen1,len2;len1=strlen(a),len2=strlen(b);for(i=1;i<=len1;i++){if(i<=len2){if(a[len1-i]-b[len2-i]-flag>=0){sum[len1-i]=a[len1-i]-b[len2-i]-flag;flag=0;}else{sum[len1-i]=a[len1-i]-b[len2-i]-flag+10;flag=1;}}else{if(a[len1-i]-flag-'0'>=0){sum[len1-i]=a[len1-i]-flag-'0';flag=0;}else{sum[len1-i]=a[len1-i]-flag+10-'0';flag=1;}}}for(i=0;ifor(;iprintf("%d",sum[i]);printf("\n");}voidcompare(chara[],charb[]){intlen1,len2;len1=strlen(a),len2=strlen(b);if(len1>len2||(len1==len2&&strcmp(a,b)>0))jian(a,b);elseif(strcmp(a,b)!=0){printf("-");jian(b,a);}elseprintf("0\n");}intmain(){chara[100],b[100];gets(a);gets(b);if(a[0]=='-'&&b[0]!='-'){printf("-");jia(&a[1],b);}elseif(a[0]=='-'&&b[0]=='-')compare(&b[1],&a[1]);elseif(a[0]!='-'&&b[0]=='-')jia(a,&b[1]);elsecompare(a,b);return0;}大写变小写#include#includeintmain(){chars[80];intlen,i;gets(s);len=strlen(s);for(i=0;i{if(s[i]>='a'&&s[i]<='z')s[i]=s[i]-32; }puts(s);return0;}到底星期几等比数列#include#includeintmain(){intm,n,sum;scanf("%d",&m);for(n=1;;n++){sum=(3*n-1)*n/2;if(sum>m)break;}printf("%d",n);return0;}分数#includeintmain(){ intk,x=1,y=1; floata,b; scanf("%d",&k); for(;y<=5000;y++){ for(x=y;x<=5000;x++){ a=1.0/k;b=1.0/x+1.0/y; if(a==b)printf("1/%d=1/%d+1/%d\n",k,x,y); } } return0;}韩信点兵#includeintmain(){ intn,i; for(i=0;;i++){ if(i%5==2&&i%6==3&&i%7==4&&i%11==5){printf("%d",i);break;} } return0;}回文字符串#include#include#include#defineMAXN5000+10charbuf[MAXN],s[MAXN];intp[MAXN];intmain(){intn,m=0,max=0,x,y;inti,j;fgets(buf,sizeof(s),stdin);n=strlen(buf);for(i=0;i{if(isalpha(buf[i])){p[m]=i;s[m++]=toupper(buf[i]);}}for(i=0;i{for(j=0;i-j>=0&&i+j{if(s[i-j]!=s[i+j])break;if(j*2+1>max){max=j*2+1;x=p[i-j];y=p[i+j];}}for(j=0;i-j>=0&&i+j+1{if(s[i-j]!=s[i+j+1])break;if(j*2+2>max){max=j*2+2;x=p[i-j];y=p[i+j+1];}}}for(i=x;i<=y;i++)printf("%c",buf[i]);printf("\n");return0;}#includeusingnamespacestd;intmain(){charA[5000],B[5000];inta=0,b,c,d,e,f,n=0,m,p,q,C[5000];while((A[a]=cin.get())!='\n')a++;for(b=0,c=0;b<=a-1;b++){if((A[b]>=65&&A[b]<=90)||(A[b]>=97&&A[b]<=122)){B[c]=A[b],C[c]=b;if(B[c]>=97&&B[c]<=122)B[c]=B[c]-32;c++;}}B[c]=32;for(d=0;d<=c-2;d++){if(B[d]==B[d+1])e=d,f=d+1,a=1;elseif(B[d]==B[d+2])e=d,f=d+2,a=1;elsecontinue;while(e-1>=0&&f+1<=c&&B[e-1]==B[f+1])e--,f++;m=f-e;if(m>n)n=m,p=e,q=f;}for(a=C[p];a<=C[q];a++)cout<cout<}鸡的体重计算数据整数部分加密#include#includeintmain(){ FILE*pi; pi=fopen("in.dat","w"); charA[1000],B[1000]; inti,n; gets(A); n=strlen(A); for(i=0;i fprintf(pi,"%c",A[i]); if('A'<=A[i]<'Z'||'a'<=A[i]<'z') B[i]=A[i]+1; if(A[i]=='Z'||A[i]=='z') B[i]=A[i]-25; } for(i=0;i printf("%c",B[i]); fclose(pi); return0;}阶乘#includeintmain(){intn;inti=2;intj=1;scanf("%d",&n);while(1){j=j*i;if(j>n)break;i++;}printf("%d\n",i-1);return0;}卡片恐怖水母#includevoidpaixu(intA[],intm){inti=1,n=0,j=0;for(;j{for(i=j+1;i{if(A[i]{n=A[j];A[j]=A[i];A[i]=n;}}}}intmain(){intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;scanf("%d%d",&n,&m);for(i=0;i{scanf("%d",&A[i]);}for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
t=a[i];
k=i-1;
while(t a[k+1]=a[k]; k--; if(k==-1)break; } a[k+1]=t; }}intmain(){ intn; inta[100]; inti; scanf("%d",&n); for(i=0;i scanf("%d",&a[i]); sort(a,n); printf("\n"); for(i=0;i if(i==n-1) printf("%d\n",a[i]); elseprintf("%d",a[i]);return0;}查找车牌号#include#includeintmain(){ inti,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); } } } return0;}成绩转化乘完倒序尺子刻度大数除法大数减法#include#include#definemax(a,b)a>b?a:b#definemin(a,b)a>b?b:aintsum[101];voidjia(chara[],charb[]){intflag=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<=lenmin){sum[lenmax-i]=a[len1-i]+b[len2-i]-'0'-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}else{if(len1>len2){sum[lenmax-i]=a[len1-i]-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}else{sum[lenmax-i]=b[len2-i]-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}}}if(flag==1)printf("1");for(i=0;iprintf("%d",sum[i]);printf("\n");}voidjian(chara[],charb[]){intflag=0,i;intlen1,len2;len1=strlen(a),len2=strlen(b);for(i=1;i<=len1;i++){if(i<=len2){if(a[len1-i]-b[len2-i]-flag>=0){sum[len1-i]=a[len1-i]-b[len2-i]-flag;flag=0;}else{sum[len1-i]=a[len1-i]-b[len2-i]-flag+10;flag=1;}}else{if(a[len1-i]-flag-'0'>=0){sum[len1-i]=a[len1-i]-flag-'0';flag=0;}else{sum[len1-i]=a[len1-i]-flag+10-'0';flag=1;}}}for(i=0;ifor(;iprintf("%d",sum[i]);printf("\n");}voidcompare(chara[],charb[]){intlen1,len2;len1=strlen(a),len2=strlen(b);if(len1>len2||(len1==len2&&strcmp(a,b)>0))jian(a,b);elseif(strcmp(a,b)!=0){printf("-");jian(b,a);}elseprintf("0\n");}intmain(){chara[100],b[100];gets(a);gets(b);if(a[0]=='-'&&b[0]!='-'){printf("-");jia(&a[1],b);}elseif(a[0]=='-'&&b[0]=='-')compare(&b[1],&a[1]);elseif(a[0]!='-'&&b[0]=='-')jia(a,&b[1]);elsecompare(a,b);return0;}大写变小写#include#includeintmain(){chars[80];intlen,i;gets(s);len=strlen(s);for(i=0;i{if(s[i]>='a'&&s[i]<='z')s[i]=s[i]-32; }puts(s);return0;}到底星期几等比数列#include#includeintmain(){intm,n,sum;scanf("%d",&m);for(n=1;;n++){sum=(3*n-1)*n/2;if(sum>m)break;}printf("%d",n);return0;}分数#includeintmain(){ intk,x=1,y=1; floata,b; scanf("%d",&k); for(;y<=5000;y++){ for(x=y;x<=5000;x++){ a=1.0/k;b=1.0/x+1.0/y; if(a==b)printf("1/%d=1/%d+1/%d\n",k,x,y); } } return0;}韩信点兵#includeintmain(){ intn,i; for(i=0;;i++){ if(i%5==2&&i%6==3&&i%7==4&&i%11==5){printf("%d",i);break;} } return0;}回文字符串#include#include#include#defineMAXN5000+10charbuf[MAXN],s[MAXN];intp[MAXN];intmain(){intn,m=0,max=0,x,y;inti,j;fgets(buf,sizeof(s),stdin);n=strlen(buf);for(i=0;i{if(isalpha(buf[i])){p[m]=i;s[m++]=toupper(buf[i]);}}for(i=0;i{for(j=0;i-j>=0&&i+j{if(s[i-j]!=s[i+j])break;if(j*2+1>max){max=j*2+1;x=p[i-j];y=p[i+j];}}for(j=0;i-j>=0&&i+j+1{if(s[i-j]!=s[i+j+1])break;if(j*2+2>max){max=j*2+2;x=p[i-j];y=p[i+j+1];}}}for(i=x;i<=y;i++)printf("%c",buf[i]);printf("\n");return0;}#includeusingnamespacestd;intmain(){charA[5000],B[5000];inta=0,b,c,d,e,f,n=0,m,p,q,C[5000];while((A[a]=cin.get())!='\n')a++;for(b=0,c=0;b<=a-1;b++){if((A[b]>=65&&A[b]<=90)||(A[b]>=97&&A[b]<=122)){B[c]=A[b],C[c]=b;if(B[c]>=97&&B[c]<=122)B[c]=B[c]-32;c++;}}B[c]=32;for(d=0;d<=c-2;d++){if(B[d]==B[d+1])e=d,f=d+1,a=1;elseif(B[d]==B[d+2])e=d,f=d+2,a=1;elsecontinue;while(e-1>=0&&f+1<=c&&B[e-1]==B[f+1])e--,f++;m=f-e;if(m>n)n=m,p=e,q=f;}for(a=C[p];a<=C[q];a++)cout<cout<}鸡的体重计算数据整数部分加密#include#includeintmain(){ FILE*pi; pi=fopen("in.dat","w"); charA[1000],B[1000]; inti,n; gets(A); n=strlen(A); for(i=0;i fprintf(pi,"%c",A[i]); if('A'<=A[i]<'Z'||'a'<=A[i]<'z') B[i]=A[i]+1; if(A[i]=='Z'||A[i]=='z') B[i]=A[i]-25; } for(i=0;i printf("%c",B[i]); fclose(pi); return0;}阶乘#includeintmain(){intn;inti=2;intj=1;scanf("%d",&n);while(1){j=j*i;if(j>n)break;i++;}printf("%d\n",i-1);return0;}卡片恐怖水母#includevoidpaixu(intA[],intm){inti=1,n=0,j=0;for(;j{for(i=j+1;i{if(A[i]{n=A[j];A[j]=A[i];A[i]=n;}}}}intmain(){intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;scanf("%d%d",&n,&m);for(i=0;i{scanf("%d",&A[i]);}for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
a[k+1]=a[k];
k--;
if(k==-1)break;
a[k+1]=t;
inta[100];
scanf("%d",&n);
for(i=0;i scanf("%d",&a[i]); sort(a,n); printf("\n"); for(i=0;i if(i==n-1) printf("%d\n",a[i]); elseprintf("%d",a[i]);return0;}查找车牌号#include#includeintmain(){ inti,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); } } } return0;}成绩转化乘完倒序尺子刻度大数除法大数减法#include#include#definemax(a,b)a>b?a:b#definemin(a,b)a>b?b:aintsum[101];voidjia(chara[],charb[]){intflag=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<=lenmin){sum[lenmax-i]=a[len1-i]+b[len2-i]-'0'-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}else{if(len1>len2){sum[lenmax-i]=a[len1-i]-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}else{sum[lenmax-i]=b[len2-i]-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}}}if(flag==1)printf("1");for(i=0;iprintf("%d",sum[i]);printf("\n");}voidjian(chara[],charb[]){intflag=0,i;intlen1,len2;len1=strlen(a),len2=strlen(b);for(i=1;i<=len1;i++){if(i<=len2){if(a[len1-i]-b[len2-i]-flag>=0){sum[len1-i]=a[len1-i]-b[len2-i]-flag;flag=0;}else{sum[len1-i]=a[len1-i]-b[len2-i]-flag+10;flag=1;}}else{if(a[len1-i]-flag-'0'>=0){sum[len1-i]=a[len1-i]-flag-'0';flag=0;}else{sum[len1-i]=a[len1-i]-flag+10-'0';flag=1;}}}for(i=0;ifor(;iprintf("%d",sum[i]);printf("\n");}voidcompare(chara[],charb[]){intlen1,len2;len1=strlen(a),len2=strlen(b);if(len1>len2||(len1==len2&&strcmp(a,b)>0))jian(a,b);elseif(strcmp(a,b)!=0){printf("-");jian(b,a);}elseprintf("0\n");}intmain(){chara[100],b[100];gets(a);gets(b);if(a[0]=='-'&&b[0]!='-'){printf("-");jia(&a[1],b);}elseif(a[0]=='-'&&b[0]=='-')compare(&b[1],&a[1]);elseif(a[0]!='-'&&b[0]=='-')jia(a,&b[1]);elsecompare(a,b);return0;}大写变小写#include#includeintmain(){chars[80];intlen,i;gets(s);len=strlen(s);for(i=0;i{if(s[i]>='a'&&s[i]<='z')s[i]=s[i]-32; }puts(s);return0;}到底星期几等比数列#include#includeintmain(){intm,n,sum;scanf("%d",&m);for(n=1;;n++){sum=(3*n-1)*n/2;if(sum>m)break;}printf("%d",n);return0;}分数#includeintmain(){ intk,x=1,y=1; floata,b; scanf("%d",&k); for(;y<=5000;y++){ for(x=y;x<=5000;x++){ a=1.0/k;b=1.0/x+1.0/y; if(a==b)printf("1/%d=1/%d+1/%d\n",k,x,y); } } return0;}韩信点兵#includeintmain(){ intn,i; for(i=0;;i++){ if(i%5==2&&i%6==3&&i%7==4&&i%11==5){printf("%d",i);break;} } return0;}回文字符串#include#include#include#defineMAXN5000+10charbuf[MAXN],s[MAXN];intp[MAXN];intmain(){intn,m=0,max=0,x,y;inti,j;fgets(buf,sizeof(s),stdin);n=strlen(buf);for(i=0;i{if(isalpha(buf[i])){p[m]=i;s[m++]=toupper(buf[i]);}}for(i=0;i{for(j=0;i-j>=0&&i+j{if(s[i-j]!=s[i+j])break;if(j*2+1>max){max=j*2+1;x=p[i-j];y=p[i+j];}}for(j=0;i-j>=0&&i+j+1{if(s[i-j]!=s[i+j+1])break;if(j*2+2>max){max=j*2+2;x=p[i-j];y=p[i+j+1];}}}for(i=x;i<=y;i++)printf("%c",buf[i]);printf("\n");return0;}#includeusingnamespacestd;intmain(){charA[5000],B[5000];inta=0,b,c,d,e,f,n=0,m,p,q,C[5000];while((A[a]=cin.get())!='\n')a++;for(b=0,c=0;b<=a-1;b++){if((A[b]>=65&&A[b]<=90)||(A[b]>=97&&A[b]<=122)){B[c]=A[b],C[c]=b;if(B[c]>=97&&B[c]<=122)B[c]=B[c]-32;c++;}}B[c]=32;for(d=0;d<=c-2;d++){if(B[d]==B[d+1])e=d,f=d+1,a=1;elseif(B[d]==B[d+2])e=d,f=d+2,a=1;elsecontinue;while(e-1>=0&&f+1<=c&&B[e-1]==B[f+1])e--,f++;m=f-e;if(m>n)n=m,p=e,q=f;}for(a=C[p];a<=C[q];a++)cout<cout<}鸡的体重计算数据整数部分加密#include#includeintmain(){ FILE*pi; pi=fopen("in.dat","w"); charA[1000],B[1000]; inti,n; gets(A); n=strlen(A); for(i=0;i fprintf(pi,"%c",A[i]); if('A'<=A[i]<'Z'||'a'<=A[i]<'z') B[i]=A[i]+1; if(A[i]=='Z'||A[i]=='z') B[i]=A[i]-25; } for(i=0;i printf("%c",B[i]); fclose(pi); return0;}阶乘#includeintmain(){intn;inti=2;intj=1;scanf("%d",&n);while(1){j=j*i;if(j>n)break;i++;}printf("%d\n",i-1);return0;}卡片恐怖水母#includevoidpaixu(intA[],intm){inti=1,n=0,j=0;for(;j{for(i=j+1;i{if(A[i]{n=A[j];A[j]=A[i];A[i]=n;}}}}intmain(){intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;scanf("%d%d",&n,&m);for(i=0;i{scanf("%d",&A[i]);}for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
scanf("%d",&a[i]);
sort(a,n);
for(i=0;i if(i==n-1) printf("%d\n",a[i]); elseprintf("%d",a[i]);return0;}查找车牌号#include#includeintmain(){ inti,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); } } } return0;}成绩转化乘完倒序尺子刻度大数除法大数减法#include#include#definemax(a,b)a>b?a:b#definemin(a,b)a>b?b:aintsum[101];voidjia(chara[],charb[]){intflag=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<=lenmin){sum[lenmax-i]=a[len1-i]+b[len2-i]-'0'-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}else{if(len1>len2){sum[lenmax-i]=a[len1-i]-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}else{sum[lenmax-i]=b[len2-i]-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10;flag=1;}elseflag=0;}}}if(flag==1)printf("1");for(i=0;iprintf("%d",sum[i]);printf("\n");}voidjian(chara[],charb[]){intflag=0,i;intlen1,len2;len1=strlen(a),len2=strlen(b);for(i=1;i<=len1;i++){if(i<=len2){if(a[len1-i]-b[len2-i]-flag>=0){sum[len1-i]=a[len1-i]-b[len2-i]-flag;flag=0;}else{sum[len1-i]=a[len1-i]-b[len2-i]-flag+10;flag=1;}}else{if(a[len1-i]-flag-'0'>=0){sum[len1-i]=a[len1-i]-flag-'0';flag=0;}else{sum[len1-i]=a[len1-i]-flag+10-'0';flag=1;}}}for(i=0;ifor(;iprintf("%d",sum[i]);printf("\n");}voidcompare(chara[],charb[]){intlen1,len2;len1=strlen(a),len2=strlen(b);if(len1>len2||(len1==len2&&strcmp(a,b)>0))jian(a,b);elseif(strcmp(a,b)!=0){printf("-");jian(b,a);}elseprintf("0\n");}intmain(){chara[100],b[100];gets(a);gets(b);if(a[0]=='-'&&b[0]!='-'){printf("-");jia(&a[1],b);}elseif(a[0]=='-'&&b[0]=='-')compare(&b[1],&a[1]);elseif(a[0]!='-'&&b[0]=='-')jia(a,&b[1]);elsecompare(a,b);return0;}大写变小写#include#includeintmain(){chars[80];intlen,i;gets(s);len=strlen(s);for(i=0;i{if(s[i]>='a'&&s[i]<='z')s[i]=s[i]-32; }puts(s);return0;}到底星期几等比数列#include#includeintmain(){intm,n,sum;scanf("%d",&m);for(n=1;;n++){sum=(3*n-1)*n/2;if(sum>m)break;}printf("%d",n);return0;}分数#includeintmain(){ intk,x=1,y=1; floata,b; scanf("%d",&k); for(;y<=5000;y++){ for(x=y;x<=5000;x++){ a=1.0/k;b=1.0/x+1.0/y; if(a==b)printf("1/%d=1/%d+1/%d\n",k,x,y); } } return0;}韩信点兵#includeintmain(){ intn,i; for(i=0;;i++){ if(i%5==2&&i%6==3&&i%7==4&&i%11==5){printf("%d",i);break;} } return0;}回文字符串#include#include#include#defineMAXN5000+10charbuf[MAXN],s[MAXN];intp[MAXN];intmain(){intn,m=0,max=0,x,y;inti,j;fgets(buf,sizeof(s),stdin);n=strlen(buf);for(i=0;i{if(isalpha(buf[i])){p[m]=i;s[m++]=toupper(buf[i]);}}for(i=0;i{for(j=0;i-j>=0&&i+j{if(s[i-j]!=s[i+j])break;if(j*2+1>max){max=j*2+1;x=p[i-j];y=p[i+j];}}for(j=0;i-j>=0&&i+j+1{if(s[i-j]!=s[i+j+1])break;if(j*2+2>max){max=j*2+2;x=p[i-j];y=p[i+j+1];}}}for(i=x;i<=y;i++)printf("%c",buf[i]);printf("\n");return0;}#includeusingnamespacestd;intmain(){charA[5000],B[5000];inta=0,b,c,d,e,f,n=0,m,p,q,C[5000];while((A[a]=cin.get())!='\n')a++;for(b=0,c=0;b<=a-1;b++){if((A[b]>=65&&A[b]<=90)||(A[b]>=97&&A[b]<=122)){B[c]=A[b],C[c]=b;if(B[c]>=97&&B[c]<=122)B[c]=B[c]-32;c++;}}B[c]=32;for(d=0;d<=c-2;d++){if(B[d]==B[d+1])e=d,f=d+1,a=1;elseif(B[d]==B[d+2])e=d,f=d+2,a=1;elsecontinue;while(e-1>=0&&f+1<=c&&B[e-1]==B[f+1])e--,f++;m=f-e;if(m>n)n=m,p=e,q=f;}for(a=C[p];a<=C[q];a++)cout<cout<}鸡的体重计算数据整数部分加密#include#includeintmain(){ FILE*pi; pi=fopen("in.dat","w"); charA[1000],B[1000]; inti,n; gets(A); n=strlen(A); for(i=0;i fprintf(pi,"%c",A[i]); if('A'<=A[i]<'Z'||'a'<=A[i]<'z') B[i]=A[i]+1; if(A[i]=='Z'||A[i]=='z') B[i]=A[i]-25; } for(i=0;i printf("%c",B[i]); fclose(pi); return0;}阶乘#includeintmain(){intn;inti=2;intj=1;scanf("%d",&n);while(1){j=j*i;if(j>n)break;i++;}printf("%d\n",i-1);return0;}卡片恐怖水母#includevoidpaixu(intA[],intm){inti=1,n=0,j=0;for(;j{for(i=j+1;i{if(A[i]{n=A[j];A[j]=A[i];A[i]=n;}}}}intmain(){intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;scanf("%d%d",&n,&m);for(i=0;i{scanf("%d",&A[i]);}for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
if(i==n-1)
printf("%d\n",a[i]);
elseprintf("%d",a[i]);
查找
车牌号
inti,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);
成绩转化
乘完倒序
尺子刻度
大数除法
大数减法
#definemax(a,b)a>b?
a:
b
#definemin(a,b)a>b?
b:
a
intsum[101];
voidjia(chara[],charb[])
intflag=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<=lenmin)
sum[lenmax-i]=a[len1-i]+b[len2-i]-'0'-'0'+flag;
if(sum[lenmax-i]>=10)
sum[lenmax-i]=sum[lenmax-i]-10;
flag=1;
elseflag=0;
else{
if(len1>len2)
sum[lenmax-i]=a[len1-i]-'0'+flag;
sum[lenmax-i]=b[len2-i]-'0'+flag;
if(flag==1)
printf("1");
for(i=0;iprintf("%d",sum[i]);printf("\n");}voidjian(chara[],charb[]){intflag=0,i;intlen1,len2;len1=strlen(a),len2=strlen(b);for(i=1;i<=len1;i++){if(i<=len2){if(a[len1-i]-b[len2-i]-flag>=0){sum[len1-i]=a[len1-i]-b[len2-i]-flag;flag=0;}else{sum[len1-i]=a[len1-i]-b[len2-i]-flag+10;flag=1;}}else{if(a[len1-i]-flag-'0'>=0){sum[len1-i]=a[len1-i]-flag-'0';flag=0;}else{sum[len1-i]=a[len1-i]-flag+10-'0';flag=1;}}}for(i=0;ifor(;iprintf("%d",sum[i]);printf("\n");}voidcompare(chara[],charb[]){intlen1,len2;len1=strlen(a),len2=strlen(b);if(len1>len2||(len1==len2&&strcmp(a,b)>0))jian(a,b);elseif(strcmp(a,b)!=0){printf("-");jian(b,a);}elseprintf("0\n");}intmain(){chara[100],b[100];gets(a);gets(b);if(a[0]=='-'&&b[0]!='-'){printf("-");jia(&a[1],b);}elseif(a[0]=='-'&&b[0]=='-')compare(&b[1],&a[1]);elseif(a[0]!='-'&&b[0]=='-')jia(a,&b[1]);elsecompare(a,b);return0;}大写变小写#include#includeintmain(){chars[80];intlen,i;gets(s);len=strlen(s);for(i=0;i{if(s[i]>='a'&&s[i]<='z')s[i]=s[i]-32; }puts(s);return0;}到底星期几等比数列#include#includeintmain(){intm,n,sum;scanf("%d",&m);for(n=1;;n++){sum=(3*n-1)*n/2;if(sum>m)break;}printf("%d",n);return0;}分数#includeintmain(){ intk,x=1,y=1; floata,b; scanf("%d",&k); for(;y<=5000;y++){ for(x=y;x<=5000;x++){ a=1.0/k;b=1.0/x+1.0/y; if(a==b)printf("1/%d=1/%d+1/%d\n",k,x,y); } } return0;}韩信点兵#includeintmain(){ intn,i; for(i=0;;i++){ if(i%5==2&&i%6==3&&i%7==4&&i%11==5){printf("%d",i);break;} } return0;}回文字符串#include#include#include#defineMAXN5000+10charbuf[MAXN],s[MAXN];intp[MAXN];intmain(){intn,m=0,max=0,x,y;inti,j;fgets(buf,sizeof(s),stdin);n=strlen(buf);for(i=0;i{if(isalpha(buf[i])){p[m]=i;s[m++]=toupper(buf[i]);}}for(i=0;i{for(j=0;i-j>=0&&i+j{if(s[i-j]!=s[i+j])break;if(j*2+1>max){max=j*2+1;x=p[i-j];y=p[i+j];}}for(j=0;i-j>=0&&i+j+1{if(s[i-j]!=s[i+j+1])break;if(j*2+2>max){max=j*2+2;x=p[i-j];y=p[i+j+1];}}}for(i=x;i<=y;i++)printf("%c",buf[i]);printf("\n");return0;}#includeusingnamespacestd;intmain(){charA[5000],B[5000];inta=0,b,c,d,e,f,n=0,m,p,q,C[5000];while((A[a]=cin.get())!='\n')a++;for(b=0,c=0;b<=a-1;b++){if((A[b]>=65&&A[b]<=90)||(A[b]>=97&&A[b]<=122)){B[c]=A[b],C[c]=b;if(B[c]>=97&&B[c]<=122)B[c]=B[c]-32;c++;}}B[c]=32;for(d=0;d<=c-2;d++){if(B[d]==B[d+1])e=d,f=d+1,a=1;elseif(B[d]==B[d+2])e=d,f=d+2,a=1;elsecontinue;while(e-1>=0&&f+1<=c&&B[e-1]==B[f+1])e--,f++;m=f-e;if(m>n)n=m,p=e,q=f;}for(a=C[p];a<=C[q];a++)cout<cout<}鸡的体重计算数据整数部分加密#include#includeintmain(){ FILE*pi; pi=fopen("in.dat","w"); charA[1000],B[1000]; inti,n; gets(A); n=strlen(A); for(i=0;i fprintf(pi,"%c",A[i]); if('A'<=A[i]<'Z'||'a'<=A[i]<'z') B[i]=A[i]+1; if(A[i]=='Z'||A[i]=='z') B[i]=A[i]-25; } for(i=0;i printf("%c",B[i]); fclose(pi); return0;}阶乘#includeintmain(){intn;inti=2;intj=1;scanf("%d",&n);while(1){j=j*i;if(j>n)break;i++;}printf("%d\n",i-1);return0;}卡片恐怖水母#includevoidpaixu(intA[],intm){inti=1,n=0,j=0;for(;j{for(i=j+1;i{if(A[i]{n=A[j];A[j]=A[i];A[i]=n;}}}}intmain(){intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;scanf("%d%d",&n,&m);for(i=0;i{scanf("%d",&A[i]);}for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
printf("%d",sum[i]);
voidjian(chara[],charb[])
intflag=0,i;
intlen1,len2;
for(i=1;i<=len1;i++)
if(i<=len2)
if(a[len1-i]-b[len2-i]-flag>=0)
sum[len1-i]=a[len1-i]-b[len2-i]-flag;
flag=0;
sum[len1-i]=a[len1-i]-b[len2-i]-flag+10;
if(a[len1-i]-flag-'0'>=0)
sum[len1-i]=a[len1-i]-flag-'0';
sum[len1-i]=a[len1-i]-flag+10-'0';
for(i=0;ifor(;iprintf("%d",sum[i]);printf("\n");}voidcompare(chara[],charb[]){intlen1,len2;len1=strlen(a),len2=strlen(b);if(len1>len2||(len1==len2&&strcmp(a,b)>0))jian(a,b);elseif(strcmp(a,b)!=0){printf("-");jian(b,a);}elseprintf("0\n");}intmain(){chara[100],b[100];gets(a);gets(b);if(a[0]=='-'&&b[0]!='-'){printf("-");jia(&a[1],b);}elseif(a[0]=='-'&&b[0]=='-')compare(&b[1],&a[1]);elseif(a[0]!='-'&&b[0]=='-')jia(a,&b[1]);elsecompare(a,b);return0;}大写变小写#include#includeintmain(){chars[80];intlen,i;gets(s);len=strlen(s);for(i=0;i{if(s[i]>='a'&&s[i]<='z')s[i]=s[i]-32; }puts(s);return0;}到底星期几等比数列#include#includeintmain(){intm,n,sum;scanf("%d",&m);for(n=1;;n++){sum=(3*n-1)*n/2;if(sum>m)break;}printf("%d",n);return0;}分数#includeintmain(){ intk,x=1,y=1; floata,b; scanf("%d",&k); for(;y<=5000;y++){ for(x=y;x<=5000;x++){ a=1.0/k;b=1.0/x+1.0/y; if(a==b)printf("1/%d=1/%d+1/%d\n",k,x,y); } } return0;}韩信点兵#includeintmain(){ intn,i; for(i=0;;i++){ if(i%5==2&&i%6==3&&i%7==4&&i%11==5){printf("%d",i);break;} } return0;}回文字符串#include#include#include#defineMAXN5000+10charbuf[MAXN],s[MAXN];intp[MAXN];intmain(){intn,m=0,max=0,x,y;inti,j;fgets(buf,sizeof(s),stdin);n=strlen(buf);for(i=0;i{if(isalpha(buf[i])){p[m]=i;s[m++]=toupper(buf[i]);}}for(i=0;i{for(j=0;i-j>=0&&i+j{if(s[i-j]!=s[i+j])break;if(j*2+1>max){max=j*2+1;x=p[i-j];y=p[i+j];}}for(j=0;i-j>=0&&i+j+1{if(s[i-j]!=s[i+j+1])break;if(j*2+2>max){max=j*2+2;x=p[i-j];y=p[i+j+1];}}}for(i=x;i<=y;i++)printf("%c",buf[i]);printf("\n");return0;}#includeusingnamespacestd;intmain(){charA[5000],B[5000];inta=0,b,c,d,e,f,n=0,m,p,q,C[5000];while((A[a]=cin.get())!='\n')a++;for(b=0,c=0;b<=a-1;b++){if((A[b]>=65&&A[b]<=90)||(A[b]>=97&&A[b]<=122)){B[c]=A[b],C[c]=b;if(B[c]>=97&&B[c]<=122)B[c]=B[c]-32;c++;}}B[c]=32;for(d=0;d<=c-2;d++){if(B[d]==B[d+1])e=d,f=d+1,a=1;elseif(B[d]==B[d+2])e=d,f=d+2,a=1;elsecontinue;while(e-1>=0&&f+1<=c&&B[e-1]==B[f+1])e--,f++;m=f-e;if(m>n)n=m,p=e,q=f;}for(a=C[p];a<=C[q];a++)cout<cout<}鸡的体重计算数据整数部分加密#include#includeintmain(){ FILE*pi; pi=fopen("in.dat","w"); charA[1000],B[1000]; inti,n; gets(A); n=strlen(A); for(i=0;i fprintf(pi,"%c",A[i]); if('A'<=A[i]<'Z'||'a'<=A[i]<'z') B[i]=A[i]+1; if(A[i]=='Z'||A[i]=='z') B[i]=A[i]-25; } for(i=0;i printf("%c",B[i]); fclose(pi); return0;}阶乘#includeintmain(){intn;inti=2;intj=1;scanf("%d",&n);while(1){j=j*i;if(j>n)break;i++;}printf("%d\n",i-1);return0;}卡片恐怖水母#includevoidpaixu(intA[],intm){inti=1,n=0,j=0;for(;j{for(i=j+1;i{if(A[i]{n=A[j];A[j]=A[i];A[i]=n;}}}}intmain(){intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;scanf("%d%d",&n,&m);for(i=0;i{scanf("%d",&A[i]);}for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
for(;iprintf("%d",sum[i]);printf("\n");}voidcompare(chara[],charb[]){intlen1,len2;len1=strlen(a),len2=strlen(b);if(len1>len2||(len1==len2&&strcmp(a,b)>0))jian(a,b);elseif(strcmp(a,b)!=0){printf("-");jian(b,a);}elseprintf("0\n");}intmain(){chara[100],b[100];gets(a);gets(b);if(a[0]=='-'&&b[0]!='-'){printf("-");jia(&a[1],b);}elseif(a[0]=='-'&&b[0]=='-')compare(&b[1],&a[1]);elseif(a[0]!='-'&&b[0]=='-')jia(a,&b[1]);elsecompare(a,b);return0;}大写变小写#include#includeintmain(){chars[80];intlen,i;gets(s);len=strlen(s);for(i=0;i{if(s[i]>='a'&&s[i]<='z')s[i]=s[i]-32; }puts(s);return0;}到底星期几等比数列#include#includeintmain(){intm,n,sum;scanf("%d",&m);for(n=1;;n++){sum=(3*n-1)*n/2;if(sum>m)break;}printf("%d",n);return0;}分数#includeintmain(){ intk,x=1,y=1; floata,b; scanf("%d",&k); for(;y<=5000;y++){ for(x=y;x<=5000;x++){ a=1.0/k;b=1.0/x+1.0/y; if(a==b)printf("1/%d=1/%d+1/%d\n",k,x,y); } } return0;}韩信点兵#includeintmain(){ intn,i; for(i=0;;i++){ if(i%5==2&&i%6==3&&i%7==4&&i%11==5){printf("%d",i);break;} } return0;}回文字符串#include#include#include#defineMAXN5000+10charbuf[MAXN],s[MAXN];intp[MAXN];intmain(){intn,m=0,max=0,x,y;inti,j;fgets(buf,sizeof(s),stdin);n=strlen(buf);for(i=0;i{if(isalpha(buf[i])){p[m]=i;s[m++]=toupper(buf[i]);}}for(i=0;i{for(j=0;i-j>=0&&i+j{if(s[i-j]!=s[i+j])break;if(j*2+1>max){max=j*2+1;x=p[i-j];y=p[i+j];}}for(j=0;i-j>=0&&i+j+1{if(s[i-j]!=s[i+j+1])break;if(j*2+2>max){max=j*2+2;x=p[i-j];y=p[i+j+1];}}}for(i=x;i<=y;i++)printf("%c",buf[i]);printf("\n");return0;}#includeusingnamespacestd;intmain(){charA[5000],B[5000];inta=0,b,c,d,e,f,n=0,m,p,q,C[5000];while((A[a]=cin.get())!='\n')a++;for(b=0,c=0;b<=a-1;b++){if((A[b]>=65&&A[b]<=90)||(A[b]>=97&&A[b]<=122)){B[c]=A[b],C[c]=b;if(B[c]>=97&&B[c]<=122)B[c]=B[c]-32;c++;}}B[c]=32;for(d=0;d<=c-2;d++){if(B[d]==B[d+1])e=d,f=d+1,a=1;elseif(B[d]==B[d+2])e=d,f=d+2,a=1;elsecontinue;while(e-1>=0&&f+1<=c&&B[e-1]==B[f+1])e--,f++;m=f-e;if(m>n)n=m,p=e,q=f;}for(a=C[p];a<=C[q];a++)cout<cout<}鸡的体重计算数据整数部分加密#include#includeintmain(){ FILE*pi; pi=fopen("in.dat","w"); charA[1000],B[1000]; inti,n; gets(A); n=strlen(A); for(i=0;i fprintf(pi,"%c",A[i]); if('A'<=A[i]<'Z'||'a'<=A[i]<'z') B[i]=A[i]+1; if(A[i]=='Z'||A[i]=='z') B[i]=A[i]-25; } for(i=0;i printf("%c",B[i]); fclose(pi); return0;}阶乘#includeintmain(){intn;inti=2;intj=1;scanf("%d",&n);while(1){j=j*i;if(j>n)break;i++;}printf("%d\n",i-1);return0;}卡片恐怖水母#includevoidpaixu(intA[],intm){inti=1,n=0,j=0;for(;j{for(i=j+1;i{if(A[i]{n=A[j];A[j]=A[i];A[i]=n;}}}}intmain(){intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;scanf("%d%d",&n,&m);for(i=0;i{scanf("%d",&A[i]);}for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
voidcompare(chara[],charb[])
if(len1>len2||(len1==len2&&strcmp(a,b)>0))
jian(a,b);
elseif(strcmp(a,b)!
jian(b,a);
printf("0\n");
gets(a);
gets(b);
jia(&a[1],b);
compare(&b[1],&a[1]);
jia(a,&b[1]);
compare(a,b);
大写变小写
{chars[80];
intlen,i;
gets(s);
len=strlen(s);
for(i=0;i{if(s[i]>='a'&&s[i]<='z')s[i]=s[i]-32; }puts(s);return0;}到底星期几等比数列#include#includeintmain(){intm,n,sum;scanf("%d",&m);for(n=1;;n++){sum=(3*n-1)*n/2;if(sum>m)break;}printf("%d",n);return0;}分数#includeintmain(){ intk,x=1,y=1; floata,b; scanf("%d",&k); for(;y<=5000;y++){ for(x=y;x<=5000;x++){ a=1.0/k;b=1.0/x+1.0/y; if(a==b)printf("1/%d=1/%d+1/%d\n",k,x,y); } } return0;}韩信点兵#includeintmain(){ intn,i; for(i=0;;i++){ if(i%5==2&&i%6==3&&i%7==4&&i%11==5){printf("%d",i);break;} } return0;}回文字符串#include#include#include#defineMAXN5000+10charbuf[MAXN],s[MAXN];intp[MAXN];intmain(){intn,m=0,max=0,x,y;inti,j;fgets(buf,sizeof(s),stdin);n=strlen(buf);for(i=0;i{if(isalpha(buf[i])){p[m]=i;s[m++]=toupper(buf[i]);}}for(i=0;i{for(j=0;i-j>=0&&i+j{if(s[i-j]!=s[i+j])break;if(j*2+1>max){max=j*2+1;x=p[i-j];y=p[i+j];}}for(j=0;i-j>=0&&i+j+1{if(s[i-j]!=s[i+j+1])break;if(j*2+2>max){max=j*2+2;x=p[i-j];y=p[i+j+1];}}}for(i=x;i<=y;i++)printf("%c",buf[i]);printf("\n");return0;}#includeusingnamespacestd;intmain(){charA[5000],B[5000];inta=0,b,c,d,e,f,n=0,m,p,q,C[5000];while((A[a]=cin.get())!='\n')a++;for(b=0,c=0;b<=a-1;b++){if((A[b]>=65&&A[b]<=90)||(A[b]>=97&&A[b]<=122)){B[c]=A[b],C[c]=b;if(B[c]>=97&&B[c]<=122)B[c]=B[c]-32;c++;}}B[c]=32;for(d=0;d<=c-2;d++){if(B[d]==B[d+1])e=d,f=d+1,a=1;elseif(B[d]==B[d+2])e=d,f=d+2,a=1;elsecontinue;while(e-1>=0&&f+1<=c&&B[e-1]==B[f+1])e--,f++;m=f-e;if(m>n)n=m,p=e,q=f;}for(a=C[p];a<=C[q];a++)cout<cout<}鸡的体重计算数据整数部分加密#include#includeintmain(){ FILE*pi; pi=fopen("in.dat","w"); charA[1000],B[1000]; inti,n; gets(A); n=strlen(A); for(i=0;i fprintf(pi,"%c",A[i]); if('A'<=A[i]<'Z'||'a'<=A[i]<'z') B[i]=A[i]+1; if(A[i]=='Z'||A[i]=='z') B[i]=A[i]-25; } for(i=0;i printf("%c",B[i]); fclose(pi); return0;}阶乘#includeintmain(){intn;inti=2;intj=1;scanf("%d",&n);while(1){j=j*i;if(j>n)break;i++;}printf("%d\n",i-1);return0;}卡片恐怖水母#includevoidpaixu(intA[],intm){inti=1,n=0,j=0;for(;j{for(i=j+1;i{if(A[i]{n=A[j];A[j]=A[i];A[i]=n;}}}}intmain(){intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;scanf("%d%d",&n,&m);for(i=0;i{scanf("%d",&A[i]);}for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
if(s[i]>='a'&&s[i]<='z')
s[i]=s[i]-32; }
puts(s);
return0;}
到底星期几
等比数列
intm,n,sum;
scanf("%d",&m);
for(n=1;;n++)
sum=(3*n-1)*n/2;
if(sum>m)
break;
printf("%d",n);
分数
intk,x=1,y=1;
floata,b;
scanf("%d",&k);
for(;y<=5000;y++){
for(x=y;x<=5000;x++){
a=1.0/k;b=1.0/x+1.0/y;
if(a==b)printf("1/%d=1/%d+1/%d\n",k,x,y);
韩信点兵
intn,i;
for(i=0;;i++){
if(i%5==2&&i%6==3&&i%7==4&&i%11==5){printf("%d",i);break;}
回文字符串
#defineMAXN5000+10
charbuf[MAXN],s[MAXN];
intp[MAXN];
intn,m=0,max=0,x,y;
inti,j;
fgets(buf,sizeof(s),stdin);
n=strlen(buf);
for(i=0;i{if(isalpha(buf[i])){p[m]=i;s[m++]=toupper(buf[i]);}}for(i=0;i{for(j=0;i-j>=0&&i+j{if(s[i-j]!=s[i+j])break;if(j*2+1>max){max=j*2+1;x=p[i-j];y=p[i+j];}}for(j=0;i-j>=0&&i+j+1{if(s[i-j]!=s[i+j+1])break;if(j*2+2>max){max=j*2+2;x=p[i-j];y=p[i+j+1];}}}for(i=x;i<=y;i++)printf("%c",buf[i]);printf("\n");return0;}#includeusingnamespacestd;intmain(){charA[5000],B[5000];inta=0,b,c,d,e,f,n=0,m,p,q,C[5000];while((A[a]=cin.get())!='\n')a++;for(b=0,c=0;b<=a-1;b++){if((A[b]>=65&&A[b]<=90)||(A[b]>=97&&A[b]<=122)){B[c]=A[b],C[c]=b;if(B[c]>=97&&B[c]<=122)B[c]=B[c]-32;c++;}}B[c]=32;for(d=0;d<=c-2;d++){if(B[d]==B[d+1])e=d,f=d+1,a=1;elseif(B[d]==B[d+2])e=d,f=d+2,a=1;elsecontinue;while(e-1>=0&&f+1<=c&&B[e-1]==B[f+1])e--,f++;m=f-e;if(m>n)n=m,p=e,q=f;}for(a=C[p];a<=C[q];a++)cout<cout<}鸡的体重计算数据整数部分加密#include#includeintmain(){ FILE*pi; pi=fopen("in.dat","w"); charA[1000],B[1000]; inti,n; gets(A); n=strlen(A); for(i=0;i fprintf(pi,"%c",A[i]); if('A'<=A[i]<'Z'||'a'<=A[i]<'z') B[i]=A[i]+1; if(A[i]=='Z'||A[i]=='z') B[i]=A[i]-25; } for(i=0;i printf("%c",B[i]); fclose(pi); return0;}阶乘#includeintmain(){intn;inti=2;intj=1;scanf("%d",&n);while(1){j=j*i;if(j>n)break;i++;}printf("%d\n",i-1);return0;}卡片恐怖水母#includevoidpaixu(intA[],intm){inti=1,n=0,j=0;for(;j{for(i=j+1;i{if(A[i]{n=A[j];A[j]=A[i];A[i]=n;}}}}intmain(){intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;scanf("%d%d",&n,&m);for(i=0;i{scanf("%d",&A[i]);}for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
if(isalpha(buf[i]))
p[m]=i;
s[m++]=toupper(buf[i]);
for(i=0;i{for(j=0;i-j>=0&&i+j{if(s[i-j]!=s[i+j])break;if(j*2+1>max){max=j*2+1;x=p[i-j];y=p[i+j];}}for(j=0;i-j>=0&&i+j+1{if(s[i-j]!=s[i+j+1])break;if(j*2+2>max){max=j*2+2;x=p[i-j];y=p[i+j+1];}}}for(i=x;i<=y;i++)printf("%c",buf[i]);printf("\n");return0;}#includeusingnamespacestd;intmain(){charA[5000],B[5000];inta=0,b,c,d,e,f,n=0,m,p,q,C[5000];while((A[a]=cin.get())!='\n')a++;for(b=0,c=0;b<=a-1;b++){if((A[b]>=65&&A[b]<=90)||(A[b]>=97&&A[b]<=122)){B[c]=A[b],C[c]=b;if(B[c]>=97&&B[c]<=122)B[c]=B[c]-32;c++;}}B[c]=32;for(d=0;d<=c-2;d++){if(B[d]==B[d+1])e=d,f=d+1,a=1;elseif(B[d]==B[d+2])e=d,f=d+2,a=1;elsecontinue;while(e-1>=0&&f+1<=c&&B[e-1]==B[f+1])e--,f++;m=f-e;if(m>n)n=m,p=e,q=f;}for(a=C[p];a<=C[q];a++)cout<cout<}鸡的体重计算数据整数部分加密#include#includeintmain(){ FILE*pi; pi=fopen("in.dat","w"); charA[1000],B[1000]; inti,n; gets(A); n=strlen(A); for(i=0;i fprintf(pi,"%c",A[i]); if('A'<=A[i]<'Z'||'a'<=A[i]<'z') B[i]=A[i]+1; if(A[i]=='Z'||A[i]=='z') B[i]=A[i]-25; } for(i=0;i printf("%c",B[i]); fclose(pi); return0;}阶乘#includeintmain(){intn;inti=2;intj=1;scanf("%d",&n);while(1){j=j*i;if(j>n)break;i++;}printf("%d\n",i-1);return0;}卡片恐怖水母#includevoidpaixu(intA[],intm){inti=1,n=0,j=0;for(;j{for(i=j+1;i{if(A[i]{n=A[j];A[j]=A[i];A[i]=n;}}}}intmain(){intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;scanf("%d%d",&n,&m);for(i=0;i{scanf("%d",&A[i]);}for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
for(j=0;i-j>=0&&i+j{if(s[i-j]!=s[i+j])break;if(j*2+1>max){max=j*2+1;x=p[i-j];y=p[i+j];}}for(j=0;i-j>=0&&i+j+1{if(s[i-j]!=s[i+j+1])break;if(j*2+2>max){max=j*2+2;x=p[i-j];y=p[i+j+1];}}}for(i=x;i<=y;i++)printf("%c",buf[i]);printf("\n");return0;}#includeusingnamespacestd;intmain(){charA[5000],B[5000];inta=0,b,c,d,e,f,n=0,m,p,q,C[5000];while((A[a]=cin.get())!='\n')a++;for(b=0,c=0;b<=a-1;b++){if((A[b]>=65&&A[b]<=90)||(A[b]>=97&&A[b]<=122)){B[c]=A[b],C[c]=b;if(B[c]>=97&&B[c]<=122)B[c]=B[c]-32;c++;}}B[c]=32;for(d=0;d<=c-2;d++){if(B[d]==B[d+1])e=d,f=d+1,a=1;elseif(B[d]==B[d+2])e=d,f=d+2,a=1;elsecontinue;while(e-1>=0&&f+1<=c&&B[e-1]==B[f+1])e--,f++;m=f-e;if(m>n)n=m,p=e,q=f;}for(a=C[p];a<=C[q];a++)cout<cout<}鸡的体重计算数据整数部分加密#include#includeintmain(){ FILE*pi; pi=fopen("in.dat","w"); charA[1000],B[1000]; inti,n; gets(A); n=strlen(A); for(i=0;i fprintf(pi,"%c",A[i]); if('A'<=A[i]<'Z'||'a'<=A[i]<'z') B[i]=A[i]+1; if(A[i]=='Z'||A[i]=='z') B[i]=A[i]-25; } for(i=0;i printf("%c",B[i]); fclose(pi); return0;}阶乘#includeintmain(){intn;inti=2;intj=1;scanf("%d",&n);while(1){j=j*i;if(j>n)break;i++;}printf("%d\n",i-1);return0;}卡片恐怖水母#includevoidpaixu(intA[],intm){inti=1,n=0,j=0;for(;j{for(i=j+1;i{if(A[i]{n=A[j];A[j]=A[i];A[i]=n;}}}}intmain(){intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;scanf("%d%d",&n,&m);for(i=0;i{scanf("%d",&A[i]);}for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
if(s[i-j]!
=s[i+j])break;
if(j*2+1>max){max=j*2+1;x=p[i-j];y=p[i+j];}
for(j=0;i-j>=0&&i+j+1{if(s[i-j]!=s[i+j+1])break;if(j*2+2>max){max=j*2+2;x=p[i-j];y=p[i+j+1];}}}for(i=x;i<=y;i++)printf("%c",buf[i]);printf("\n");return0;}#includeusingnamespacestd;intmain(){charA[5000],B[5000];inta=0,b,c,d,e,f,n=0,m,p,q,C[5000];while((A[a]=cin.get())!='\n')a++;for(b=0,c=0;b<=a-1;b++){if((A[b]>=65&&A[b]<=90)||(A[b]>=97&&A[b]<=122)){B[c]=A[b],C[c]=b;if(B[c]>=97&&B[c]<=122)B[c]=B[c]-32;c++;}}B[c]=32;for(d=0;d<=c-2;d++){if(B[d]==B[d+1])e=d,f=d+1,a=1;elseif(B[d]==B[d+2])e=d,f=d+2,a=1;elsecontinue;while(e-1>=0&&f+1<=c&&B[e-1]==B[f+1])e--,f++;m=f-e;if(m>n)n=m,p=e,q=f;}for(a=C[p];a<=C[q];a++)cout<cout<}鸡的体重计算数据整数部分加密#include#includeintmain(){ FILE*pi; pi=fopen("in.dat","w"); charA[1000],B[1000]; inti,n; gets(A); n=strlen(A); for(i=0;i fprintf(pi,"%c",A[i]); if('A'<=A[i]<'Z'||'a'<=A[i]<'z') B[i]=A[i]+1; if(A[i]=='Z'||A[i]=='z') B[i]=A[i]-25; } for(i=0;i printf("%c",B[i]); fclose(pi); return0;}阶乘#includeintmain(){intn;inti=2;intj=1;scanf("%d",&n);while(1){j=j*i;if(j>n)break;i++;}printf("%d\n",i-1);return0;}卡片恐怖水母#includevoidpaixu(intA[],intm){inti=1,n=0,j=0;for(;j{for(i=j+1;i{if(A[i]{n=A[j];A[j]=A[i];A[i]=n;}}}}intmain(){intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;scanf("%d%d",&n,&m);for(i=0;i{scanf("%d",&A[i]);}for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
=s[i+j+1])break;
if(j*2+2>max){max=j*2+2;x=p[i-j];y=p[i+j+1];}
for(i=x;i<=y;i++)
printf("%c",buf[i]);
usingnamespacestd;
charA[5000],B[5000];
inta=0,b,c,d,e,f,n=0,m,p,q,C[5000];
while((A[a]=cin.get())!
='\n')a++;
for(b=0,c=0;b<=a-1;b++)
if((A[b]>=65&&A[b]<=90)||(A[b]>=97&&A[b]<=122))
B[c]=A[b],C[c]=b;
if(B[c]>=97&&B[c]<=122)B[c]=B[c]-32;
c++;
B[c]=32;
for(d=0;d<=c-2;d++)
if(B[d]==B[d+1])e=d,f=d+1,a=1;
elseif(B[d]==B[d+2])e=d,f=d+2,a=1;
elsecontinue;
while(e-1>=0&&f+1<=c&&B[e-1]==B[f+1])e--,f++;
m=f-e;
if(m>n)n=m,p=e,q=f;
for(a=C[p];a<=C[q];a++)
cout<cout<}鸡的体重计算数据整数部分加密#include#includeintmain(){ FILE*pi; pi=fopen("in.dat","w"); charA[1000],B[1000]; inti,n; gets(A); n=strlen(A); for(i=0;i fprintf(pi,"%c",A[i]); if('A'<=A[i]<'Z'||'a'<=A[i]<'z') B[i]=A[i]+1; if(A[i]=='Z'||A[i]=='z') B[i]=A[i]-25; } for(i=0;i printf("%c",B[i]); fclose(pi); return0;}阶乘#includeintmain(){intn;inti=2;intj=1;scanf("%d",&n);while(1){j=j*i;if(j>n)break;i++;}printf("%d\n",i-1);return0;}卡片恐怖水母#includevoidpaixu(intA[],intm){inti=1,n=0,j=0;for(;j{for(i=j+1;i{if(A[i]{n=A[j];A[j]=A[i];A[i]=n;}}}}intmain(){intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;scanf("%d%d",&n,&m);for(i=0;i{scanf("%d",&A[i]);}for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
cout<}鸡的体重计算数据整数部分加密#include#includeintmain(){ FILE*pi; pi=fopen("in.dat","w"); charA[1000],B[1000]; inti,n; gets(A); n=strlen(A); for(i=0;i fprintf(pi,"%c",A[i]); if('A'<=A[i]<'Z'||'a'<=A[i]<'z') B[i]=A[i]+1; if(A[i]=='Z'||A[i]=='z') B[i]=A[i]-25; } for(i=0;i printf("%c",B[i]); fclose(pi); return0;}阶乘#includeintmain(){intn;inti=2;intj=1;scanf("%d",&n);while(1){j=j*i;if(j>n)break;i++;}printf("%d\n",i-1);return0;}卡片恐怖水母#includevoidpaixu(intA[],intm){inti=1,n=0,j=0;for(;j{for(i=j+1;i{if(A[i]{n=A[j];A[j]=A[i];A[i]=n;}}}}intmain(){intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;scanf("%d%d",&n,&m);for(i=0;i{scanf("%d",&A[i]);}for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
鸡的体重
计算数据整数部分
加密
FILE*pi;
pi=fopen("in.dat","w");
charA[1000],B[1000];
inti,n;
gets(A);
n=strlen(A);
for(i=0;i fprintf(pi,"%c",A[i]); if('A'<=A[i]<'Z'||'a'<=A[i]<'z') B[i]=A[i]+1; if(A[i]=='Z'||A[i]=='z') B[i]=A[i]-25; } for(i=0;i printf("%c",B[i]); fclose(pi); return0;}阶乘#includeintmain(){intn;inti=2;intj=1;scanf("%d",&n);while(1){j=j*i;if(j>n)break;i++;}printf("%d\n",i-1);return0;}卡片恐怖水母#includevoidpaixu(intA[],intm){inti=1,n=0,j=0;for(;j{for(i=j+1;i{if(A[i]{n=A[j];A[j]=A[i];A[i]=n;}}}}intmain(){intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;scanf("%d%d",&n,&m);for(i=0;i{scanf("%d",&A[i]);}for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
fprintf(pi,"%c",A[i]);
if('A'<=A[i]<'Z'||'a'<=A[i]<'z')
B[i]=A[i]+1;
if(A[i]=='Z'||A[i]=='z')
B[i]=A[i]-25;
for(i=0;i printf("%c",B[i]); fclose(pi); return0;}阶乘#includeintmain(){intn;inti=2;intj=1;scanf("%d",&n);while(1){j=j*i;if(j>n)break;i++;}printf("%d\n",i-1);return0;}卡片恐怖水母#includevoidpaixu(intA[],intm){inti=1,n=0,j=0;for(;j{for(i=j+1;i{if(A[i]{n=A[j];A[j]=A[i];A[i]=n;}}}}intmain(){intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;scanf("%d%d",&n,&m);for(i=0;i{scanf("%d",&A[i]);}for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
printf("%c",B[i]);
fclose(pi);
阶乘
inti=2;
intj=1;
while
(1)
j=j*i;
if(j>n)break;
i++;
printf("%d\n",i-1);
卡片
恐怖水母
voidpaixu(intA[],intm)
inti=1,n=0,j=0;
for(;j{for(i=j+1;i{if(A[i]{n=A[j];A[j]=A[i];A[i]=n;}}}}intmain(){intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;scanf("%d%d",&n,&m);for(i=0;i{scanf("%d",&A[i]);}for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
for(i=j+1;i{if(A[i]{n=A[j];A[j]=A[i];A[i]=n;}}}}intmain(){intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;scanf("%d%d",&n,&m);for(i=0;i{scanf("%d",&A[i]);}for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
if(A[i]{n=A[j];A[j]=A[i];A[i]=n;}}}}intmain(){intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;scanf("%d%d",&n,&m);for(i=0;i{scanf("%d",&A[i]);}for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
n=A[j];
A[j]=A[i];
A[i]=n;
intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;
scanf("%d%d",&n,&m);
for(i=0;i{scanf("%d",&A[i]);}for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
scanf("%d",&A[i]);
for(i=0;i{scanf("%d",&B[i]);}if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
scanf("%d",&B[i]);
if(m{printf("NULL\n");}else{paixu(A,n);paixu(B,m);for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
printf("NULL\n");
paixu(A,n);
paixu(B,m);
for(i=0;i{if(A[0]<=B[i]){if(m-i>=n){for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
if(A[0]<=B[i])
if(m-i>=n)
for(k=0;k{j+=B[i+k];}printf("%d\n",j);}else{printf("NULL\n");}break;}}}return0;}快速排序#includevoidQuickSort(intA[],intn,intL,intR){ inti,j,t; if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
j+=B[i+k];
printf("%d\n",j);
快速排序
voidQuickSort(intA[],intn,intL,intR)
inti,j,t;
if(L i=L;j=R+1; while(1){ while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
i=L;j=R+1;
(1){
while(i+1 while(j-1>-1&&A[--j]>A[L]); if(i>=j)break; t=A[i];A[i]=A[j];A[j]=t; } t=A[L],A[L]=A[j],A[j]=t; QuickSort(A,n,L,j-1); QuickSort(A,n,j+1,R); } }intmain(){ intA[1000],n,i,j,p; scanf("%d",&n); if(n>=1000){printf("Overflow!!!");return0;} //输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!!!” for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
while(j-1>-1&&A[--j]>A[L]);
if(i>=j)break;
t=A[i];A[i]=A[j];A[j]=t;
t=A[L],A[L]=A[j],A[j]=t;
QuickSort(A,n,L,j-1);
QuickSort(A,n,j+1,R);
intA[1000],n,i,j,p;
if(n>=1000){printf("Overflow!
!
");return0;}
//输入要排序的元素的数目,若大于1000则结束程序输出“Overflow!
”
for(i=0;i scanf("%d",&A[i]);//输入元素 QuickSort(A,n,0,n-1); for(i=n-1;i>=0;i--) printf("%d",A[i]);//输出排序好的结果return0;}两人三足#includeintmain(){ intn,a[50],i,j,t,sum=0; scanf("%d\n",&n); for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
scanf("%d",&A[i]);//输入元素
QuickSort(A,n,0,n-1);
for(i=n-1;i>=0;i--)
printf("%d",A[i]);//输出排序好的结果
两人三足
intn,a[50],i,j,t,sum=0;
scanf("%d\n",&n);
for(i=0;i for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
for(i=0;i for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
for(j=0;j if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
if(a[j] } } for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
for(i=0;i printf("%d",sum); return0;}逆序输出偶数和#include#includeintmain(){intn,i,sum=0;scanf("%d",&n);inta[n];for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
printf("%d",sum);
逆序输出
偶数和
intn,i,sum=0;
inta[n];
for(i=0;i{scanf("%d",&a[i]);}for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
{scanf("%d",&a[i]);}
for(i=0;i{if(i%2==0)sum=sum+a[i];} printf("%d",sum);return0;}三角形面积士兵移动输出位数#includeintmain(){inti,n;scanf("%d",&n);for(i=1;;i++){if(n/10==0)break;elsen=n/10;}printf("%d",i);}数列#includeintmain(){ intA[10],B[5],i;doubleC[5]; for(i=0;i<5;i++) scanf("%d",&A[i]); for(i=0;i<4;i++){ B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i]; } if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){ for(i=5;i<10;i++) A[i]=A[i-1]+B[0],printf("%d",A[i]);return0; }if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){ for(i=5;i<10;i++) A[i]=A[i-1]*C[0],printf("%d",A[i]); return0; } if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){ for(i=5;i<10;i++) A[i]=A[i-1]+A[i-2], printf("%d",A[i]); return0; } printf("NULL"); return0;}数字加密数组元素和水仙花数提取字符串#include#includeintmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
{if(i%2==0)sum=sum+a[i];}
三角形面积
士兵移动
输出位数
for(i=1;;i++)
if(n/10==0)break;
elsen=n/10;
printf("%d",i);
数列
intA[10],B[5],i;doubleC[5];
for(i=0;i<5;i++)
for(i=0;i<4;i++){
B[i]=A[i+1]-A[i];C[i]=(double)A[i+1]/A[i];
if(B[0]==B[1]&&B[1]==B[2]&&B[2]==B[3]){
for(i=5;i<10;i++)
A[i]=A[i-1]+B[0],printf("%d",A[i]);return0;
if(C[0]==C[1]&&C[1]==C[2]&&C[2]==C[3]){
A[i]=A[i-1]*C[0],printf("%d",A[i]);
if((A[0]+A[1]==A[2])&&(A[1]+A[2]==A[3])&&(A[2]+A[3]==A[4])){
A[i]=A[i-1]+A[i-2],
printf("%d",A[i]);
printf("NULL");
数字加密
数组元素和
水仙花数
提取字符串
charA[100];
charl[100];
intm,n,i,j;
for(i=m;i { l[i]=A[i]; } for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
l[i]=A[i];
for(j=m;j { printf("%c",l[j]); } printf("\n"); return0;}添加行号#include#includeintmain(){
printf("%c",l[j]);
添加行号
copyright@ 2008-2023 冰点文库 网站版权所有
经营许可证编号:鄂ICP备19020893号-2