1:2:3#include<stdio.h>{{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;return 0;}8{n=0;p=i;for(j=0;p!=0;j++) {b[j]=p%10;p=p/10;}for(k=0;k<j;k++)if(n==1){printf("%d ",i); continue;}}return 0;}8的次数A*B{for (j=0;j<cb;j++)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;}}{{printf("-");cheng(&a[1],b);}else if(a[0]=='-'&&b[0]=='-') {cheng(&a[1],&b[1]);}}N#include<math.h>#define PI 3.1415926int main(){double s,a;int n;scanf("%d %lf",&n,&a);s=a*a*n/(2*2*tan(PI/n));}{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 ");}}{int i;int k;int t;for(i=1;i<n;i++){t=a[i];k=i-1;while(t<a[k]){}{int i;scanf("%d",&n);for(i=0;i<n;i++)scanf("%d",&a[i]);sort(a,n);printf("\n");for(i=0;i<n;i++)if(i==n-1)}{for(i=1;i<=9;i++){for(j=0;j<=9;j++){for(n=33;n<=100;n++){if((n*n)==(i*1100+j*11))printf("%d",i*1100+j*11);}}}return 0;}int sum[101];void jia(char a[],char b[]){int flag=0,i,len1,len2,lenmax,lenmin;len1=strlen(a),len2=strlen(b);lenmax=max(len1,len2),lenmin=min(len1,len2); for(i=1;i<=lenmax;i++){if(len1>len2){sum[lenmax-i]=a[len1-i]-'0'+flag;if(sum[lenmax-i]>=10){sum[lenmax-i]=sum[lenmax-i]-10; flag=1;}}}}if(flag==1)printf("1");for(i=0;i<lenmax;i++)printf("%d",sum[i]);printf("\n");}{{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;sum[len1-i]=a[len1-i]-flag+10-'0';flag=1;}}for(i=0;i<len1&&sum[i]==0;i++); for(;i<len1;i++)printf("%d",sum[i]);}{jian(b,a);}elseprintf("0\n");int main(){char a[100],b[100];elsecompare(a,b);return 0;}大写变小写#include<stdio.h>#include<string.h>int main()等比数列#include <stdio.h>#include <stdlib.h>int main(){int m,n,sum;scanf ("%d",&m); for (n=1; ;n++){int k,x=1,y=1;float a,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);}return 0;}回文字符串#include<stdio.h>#include<string.h>#include<ctype.h>#define MAXN 5000+10{p[m]=i;s[m++]=toupper(buf[i]); }}for(i=0;i<m;i++){for(j=0;i-j>=0&&i+j<m;j++)printf("%c",buf[i]);printf("\n");return 0;}#include<iostream>using namespace std;int main(){char A[5000],B[5000];B[c]=32;for(d=0;d<=c-2;d++){if(B[d]==B[d+1]) e=d,f=d+1,a=1;else if(B[d]==B[d+2]) e=d,f=d+2,a=1;else continue;while(e-1>=0&&f+1<=c&&B[e-1]==B[f+1]) e--,f++; m=f-e;int main(){FILE*pi;pi=fopen("in.dat","w");char A[1000],B[1000];int i,n;gets(A);n=strlen(A);}阶乘#include<stdio.h>int main(){int n;int i=2;int j=1;恐怖水母#include<stdio.h>void paixu(int A[],int m) {int i=1,n=0,j=0;for(;j<m;j++){for(i=j+1;i<m;i++){int n=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0; scanf("%d%d",&n,&m);for(i=0;i<n;i++){scanf("%d",&A[i]); }for(i=0;i<m;i++)for(i=0;i<m;i++) {if(A[0]<=B[i]){if(m-i>=n){for(k=0;k<n;k++) {}return 0;}快速排序#include<stdio.h>void QuickSort(int A[],int n,int L,int R) {int i,j,t;}}int main(){int A[1000],n,i,j,p;scanf("%d",&n);if(n>=1000) {printf("Overflow!!!") ;return 0; }//输入要排序的元素的数目，若大于1000则结束程序输出“Overflow!!!”int n,a[50],i,j,t,sum=0;scanf("%d\n",&n);for (i=0;i<n;i++) scanf("%d",&a[i]);for (i=0;i<n;i++) {for (j=0;j<n-i-1;j++) {if (a[j]<a[j+1]) t=a[j],a[j]=a[j+1],a[j+1]=t;}}scanf("%d",&n);int a[n];for(i=0;i<n;i++){scanf("%d",&a[i]);}for(i=0;i<n;i++){if(i%2==0)sum=sum+a[i];} printf("%d",sum);return 0;if(n/10==0)break;else n=n/10;}printf("%d",i);}数列#include<stdio.h>int main()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]);return 0;}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],#include <stdio.h>#include<string.h>int main(){char A[100];char l[100];gets(A);int m,n,i,j;scanf("%d",&m);}添加行号#include<stdio.h> #include<string.h>int main(){char A[3][100],B[3][100];int i;fclose(fp);printf("0001 ");puts(A[0]);printf("0002 ");puts(A[1]);printf("0003 ");puts(A[2]);return 0;}舞伴配对相乘后位数相加if(k==0)printf("9\n"); elseprintf("%d\n",k);}return 0;}#include <iostream>for(d=0,b--;b>=0;b--,d++) Y[d]=B[b]-48;for(e=0;e<=c-1;e++)for(f=0;f<=d-1;f++)m=m+X[e]*Y[f];while(m>10){a=m%10,m=(m-a)/10+a;int a3;int a4;}tag;int main(){ tag a[100],b[100]; int n,i,j=1,k=0; FILE *fp;scanf("%d",&n);fclose(fp);}return 0;}星期几星座#include <stdio.h>int main()else printf("Taurus");break;case 5:if(b<=20)printf("Taurus");else printf("Gemini");break;case 6:if(b<=21)printf("Gemini");else printf("Cancer");break;case 7:if(b<=22)printf("Cancer");else printf("Leo");break;case 8:if(b<=22)printf("Leo");}幸运数学号循环移位#include <stdio.h>int move(int value,int n){if(n<0)scanf("%d %d",&x,&y);printf("%d\n",move(x,y)); return 0;}月份天数#include <stdio.h> int main(){运费职工信息字符串替换#include<stdio.h>#include<string.h>int main(){}for(i=0;A[i]!='\0';i++){if(A[i-2]=='w'&&A[i-1]=='e'&&A[i]==' ')continue;elseprintf("%c",A[i]);}gets(A);scanf("%d%d",&p,&n);for(i=p;i<=p+n-1;i++,j++){ B[j]=A[i];}puts(B);}总分最高for(i=0;i<n;i++)scanf("%d",&a[i]); max=a[0];min=a[0];for(i=0;i<n;i++){if(a[i]>max) max=a[i]; if(a[i]<min) min=a[i];t=M*N;for(i=1;i<=t;i++) {if(i%N==0)。