ccf真题答案用c语言实现,CCF历年真题C语言答案

《CCF历年真题C语言答案》由会员分享，可在线阅读，更多相关《CCF历年真题C语言答案(23页珍藏版)》请在人人文库网上搜索。

1、题1：出现次数最多的数#includeint main()int i,j, n, s;int t = 1;int a10001 = 0;scanf(%d, &n);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;i。

2、f (sum%11 = a12-0)|(sum%11=10&a12=X) /注意正确情况几种类型printf(Right);elseif (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, &n);for (i = 0; i typedef struct window1int x1,x2,y1,y2,order; window;void Inputwindow(window ws,int n)int i;for(。

3、i=1;i=wsi.x1&x=wsi.y1&y=0;i-)wsi+1=wsi;ws0=w;int main()int i,n,m,x,y,pos;scanf(%d%d,&n,&m);window wsn;Inputwindow(ws,n);for(i=0;i#includeint main()int i, j, n,t=0;int a1001;scanf(%d, &n);for (i = 0; i int main()int i, j, n,k, t = 0;int a1014;scanf(%d, &n);for (i = 0; i = ak0 & j = ak1 & i int main()。

4、int i, n, s = 0;int a1001 = 0 ;scanf(%d, &n);for (i = 0; i int main()int i, j, k, n;int a500500;scanf(%d, &n);for (i = 0; i#define N 1000 int aNN;int main()int i, j, n, m;scanf(%d%d, &n, &m);for (i = 0; i int main()int i, j, n,s=0;int a1001 = 0; /注意初始化赋值scanf(%d, &n);for (i = 0; i 0; i-) /i为从后找起的频数f。

5、or (j = 0; j int main()int i, n,t=0;int a1001;scanf(%d, &n);for (i = 0; i int main()int y, d, day, i;int mouth13 = 0,31,28,31,30,31,30,31,31,30,31,30,31 ;scanf(%d%d, &y, &d);if (y % 4 = 0 & y % 100 != 0) | (y % 400 = 0)mouth2+;for (i = 1; i mouthi)d = d - mouthi;if (d = 0)d = mouthi;break;else break。

6、; /注意中断，确保月份不出错printf(%dn%d, i, d);return 0;题13：数位之和#includeint main()int n, sum = 0;scanf(%d, &n);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, &n, &m);for (i = 0; i = 3)for (k = j - t + 1; k =。

7、 3)for (k = i - t + 1; k int main()int i, n,t=0;int a1001;scanf(%d, &n);for (i = 0; i ai & ai + 1 ai + 2) t+;printf(%d, t);return 0;题16：俄罗斯方块#includeint main()int i, j, n;int k = 0,count=0,down=0;int x4, y4;int a1510;int b44;for (i = 0; i #includeint main()int i, n,t=0;int a1001 = 0 ;scanf(%d, &n);f。

8、or (i = 0; i int main()int i, j, n, t,k;int flag;int a100 = 0 ;int b20 = 0;scanf(%d, &n);for (i = 0; i = t) /有连续座位for (k = 1; k 0) /无连续座位且有人买票for (j = 0; j = 1) /分散买票printf(%d , j * 5 + (5 - bj) + 1);t-;bj-;printf(n); /注意换行的情况return 0;题19：中间数#includeint main()int i,j,n,zuo,you;int t = -1;int a1001;s。

9、canf(%d, &n);for (i = 0; i aj)zuo+;if (ai int main()int i, t;int x = 0;scanf(%d, &t);if (t = 3600 & i = 5100 & i = 8100 & i = 12600 & i = 38600 & i = 58600 & i = 83600)x += (i - 83500)*0.45 + 45 + 300 + 900 + 6500 + 6000 + 8750;if (i - x = t)printf(%d, i);break;return 0;题21：分蛋糕#includeint main()int 。

10、i, n, k;int sum = 0, t = 0;int a1001;scanf(%d%d, &n, &k);for (i = 0; i =k)t+;sum = 0;else if (i = n - 1) /注意这里的else ift+;printf(%d, t);return 0;题22：学生排队#includeint main()int i, j, n, m;int p, q, k;scanf(%d%d, &n, &m);int a1001 = 0 ;for (i = 1; i = q; k-) /注意循环移动数组中的元素aj + k + 1 = aj + k;aj + q = p;e。

11、lse if (q 0)for (k = 0; k int main()int N, t = 0;scanf(%d, &N);if (N struct seq int key;int action;int time;int main() int num, order;int i = 0, j = 0;int w = 0, s = 0, c = 0;scanf(%d%d, &num, &order);int keysnum;struct seq arrorder * 2, temp;for (i = 0; i arrj.time)temp = arri;arri = arrj;arrj = te。

12、mp;else if (arri.time = arrj.time)if (arri.action = 0 & arrj.action = 1)temp = arri;arri = arrj;arrj = temp;else if (arri.action = arrj.action & arri.key arrj.key)temp = arri;arri = arrj;arrj = temp;for (i = 0; i #includeint main()int i, j, n,t;int a1001 = 0 ;scanf(%d, &n);for (i = 0; i abs(ai - aj)。

13、t = abs(ai - aj);printf(%d, t);return 0;题26：游戏#includeint main()int i, n, k,t;int count = 0;int a1001 = 0 ;scanf(%d%d, &n, &k);for (i = 0; i 1)if (ai = 1)count+;if (count%k = 0) | (count % 10 = k)ai = 0;t-;i+;i = i%n; /圈数for (i = 0; i int main()int i, n;int sum = 0,t=0;while (1)scanf(%d, &n);if (n = 0)break;elseif (n = 1)sum+;t = 0;if (n = 2)sum = sum + 2 * (t + 1);t+;printf(%d, sum);return 0。