1、题 1：出现次数最多的数#includeint main()int i,j, n, s;int t = 1;int a10001 = 0;scanf(“%d“, for (i = 0; i at) t=s;if (as = at) t=(sint main()int sum=0;char a13 = 0;gets(a);sum = (a0 - 0)*1 + (a2 - 0) * 2 + (a3 - 0) * 3 + (a4 - 0) * 4 + (a6 - 0) * 5 + (a7 - 0) * 6 + (a8 - 0) * 7 + (a9 - 0) * 8 +(a10 - 0) * 9;if
2、 (sum%11 = a12-0)|(sum%11=10elseif (sum%11 = 10)a12 = X;elsea12 = sum%11 + 0;puts(a);return 0;题 3：相反数#includeint main()int i, j, n,t=0;int a501;scanf(“%d“, for (i = 0; i typedef struct window1int x1,x2,y1,y2,order; window;void Inputwindow(window ws,int n)int i;for(i=1;i=wsi.x1i-)wsi+1=wsi;ws0=w;int
3、main()int i,n,m,x,y,pos;scanf(“%d%d“,window wsn;Inputwindow(ws,n);for(i=0;i#includeint main()int i, j, n,t=0;int a1001;scanf(“%d“, for (i = 0; i int main()int i, j, n,k, t = 0;int a1014;scanf(“%d“, for (i = 0; i = ak0 int a1001 = 0 ;scanf(“%d“, for (i = 0; i int main()int i, j, k, n;int a500500;scan
4、f(“%d“, for (i = 0; i#define N 1000 int aNN;int main()int i, j, n, m;scanf(“%d%d“, for (i = 0; i int main()int i, j, n,s=0;int a1001 = 0; /注意初始化赋值scanf(“%d“, for (i = 0; i 0; i-) /i为从后找起的频数for (j = 0; j int main()int i, n,t=0;int a1001;scanf(“%d“, for (i = 0; i int main()int y, d, day, i;int mouth13
5、 = 0,31,28,31,30,31,30,31,31,30,31,30,31 ;scanf(“%d%d“, if (y % 4 = 0 for (i = 1; i mouthi)d = d - mouthi;if (d = 0)d = mouthi;break;else break; /注意中断，确保月份不出错printf(“%dn%d“, i, d);return 0;题 13：数位之和#includeint main()int n, sum = 0;scanf(“%d“, while (n)sum = sum + n%10;n = n / 10;printf(“%d“, sum);return 0;题 14：消除类游戏#includeint main()int i, j,k, n, m,t=1;int a3131 = 0 ;int b3131 = 0 ;scanf(“%d%d“, for (i = 0; i = 3)for (k = j - t + 1; k = 3)for (k = i - t + 1; k int main()int i, n,t=0;int a1001;
