CCF歷年真題C語言答案精編版_第1頁
CCF歷年真題C語言答案精編版_第2頁
CCF歷年真題C語言答案精編版_第3頁
CCF歷年真題C語言答案精編版_第4頁
CCF歷年真題C語言答案精編版_第5頁
免費預(yù)覽已結(jié)束,剩余16頁可下載查看

付費下載

下載本文檔

版權(quán)說明:本文檔由用戶提供并上傳,收益歸屬內(nèi)容提供方,若內(nèi)容存在侵權(quán),請進(jìn)行舉報或認(rèn)領(lǐng)

文檔簡介

1、最新資料推薦1題1:出現(xiàn)次數(shù)最多的數(shù)#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=(st? s:t);printf(%d, t);return 0;題2:ISBN號碼#includeint 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 + (

2、a7 - 0) * 6 + (a8 - 0) * 7 + (a9 - 0) * 8 + (a10 - 0) * 9;if (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:相反數(shù)#includeint main()注意正確情況幾種類型最新資料推薦2int i, j, n,t=0;int a501;scanf(%d, &n);for (i = 0; i n; i+)scanf(%d, &

3、ai);for (i = 0; i n-1; i+)for (j = i + 1; j n; j+)if (ai + aj = 0) t+;printf(%d, t);return 0;題4:窗口#includetypedef struct window1int x1,x2,y1,y2,order; window;void Inputwindow(window ws,int n)int i;for(i=1;i=n;i+)scanf(%d%d%d%d,&wsn-i.x1,&wsn-i.y1,&wsn-i.x2,&wsn-i.y2);wsn-i.order=i;in

4、t getpos(window ws,int n,int x,int y)int i;for(i=0;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;im;i+)scanf(%d%d,&x,&y);pos=getpos(ws,n,x,y);if(pos=-1) printf(IGNOREDn);else printf(%dn,wspos.ord

5、er); movewindow(ws,n,pos);return 0;題5:相鄰數(shù)對#include#includeint main()int i, j, n,t=0;int a1001;scanf(%d, &n);for (i = 0; i n; i+)scanf(%d, &ai);for (i = 0; i n - 1; i+)for (j = i + 1; j n; j+)if (abs(ai - aj) = 1) t+;printf(%d, t);return 0;題6:畫圖#includeint main()int i, j, n,k, t = 0;int a1014

6、;scanf(%d, &n);for (i = 0; i n; i+)最新資料推薦4scanf(%d%d%d%d, &ai0, &ai1, &ai2, &ai3);for (i = 0; i 101; i+)for (j = 0; j 101; j+)for (k = 0; k = ak0 & j = ak1 & i ak3)break;if (k n)t+;printf(%d, t); return 0;題7:門禁系統(tǒng)#include int main()int i, n, s = 0; int a1001 = 0 ; scanf(%d

7、, &n);for (i = 0; i n; i+)scanf(%d, &s); as+;printf(%d , as);return 0;題8:z字形掃描#includeint main()int i, j, k, n;int a500500;scanf(%d, &n);for (i = 0; in; i+)for (j = 0; jn; j+)scanf(%d, &aij);for (k = 0; k2 * n - 1; k+)for (i = 0; in; i+)for (j = 0; jn; j+)if (i + j = k)最新資料推薦5if (k %

8、 2 = 0)printf(%d elseprintf(%d return 0;題9:圖像旋轉(zhuǎn)#include#define N 1000int aNN;int main()int i, j, n, m;scanf(%d%d, &n, &m);for (i = 0; i n; i+)for (j = 0; j m; j+)scanf(%d, &aij);for (j = 1; j =m; j+)for (i = 0; i n; i+)if (i != 0)printf( );printf(%d, aim - j);printf(n);return 0;, aji);,

9、aij);最新資料推薦6題10:數(shù)字排序#includeint main()int i, j, n,s=0;int a1001 = 0; /scanf(%d, &n);for (i = 0; i 0; i-) /ifor (j = 0; j 1001; j+) /return 0;為從后找起的頻數(shù)找自己if (aj = i) /printf(%d %dn, j, aj);題11:數(shù)列分段#includeint main()int i, n,t=0;int a1001; scanf(%d,&n);for (i = 0; i n; i+)scanf(%d, &ai);for

10、 (i = 0; i n - 1; i+)if (ai != ai + 1) t+;printf(%d, t + 1);return 0;數(shù)組下標(biāo)從小到大最新資料推薦7最新資料推薦8題12:日期計算#includeint 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 -

11、 mouthi;if (d= 0)d = mouthi; break;else break; /注意中斷,確保月份不printf(%dn%d, i, d); return 0;題13:數(shù)位之和#include int 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 ;最新資料推薦9int b3131 = 0 ;sca

12、nf(%d%d, &n, &m);for (i = 0; i n; i+)for (j = 0; j m; j+)scanf(%d, &aij);for (i = 0; i n; i+)for (j = 0; j = 3)for (k = j - t + 1; k = j; k+)bik = 1;t = 1;for (j = 0; j m; j+)for (i = 0; i = 3)for (k = i - t + 1; k = i; k+)bkj = 1; t = 1;for (i = 0; i n; i+)for (j = 0; j m; j+)if (bij) a

13、ij = 0; /將找到的賦0for (i = 0; i n; i+)最新資料推薦10for (j = 0; j m; j+)printf(%d , aij);printf(n);return 0;題15:折點計數(shù)#includeint main()int i, n,t=0;int a1001; scanf(%d, &n);for (i = 0; i n; i+)最新資料推薦11scanf(%d, &ai);for (i = 0; i n-2; i+)if (ai + 1 ai & ai + 1 ai & ai + 1 ai +2) t+;printf(%d,

14、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 15; i+)for (j = 0; j 10; j+)scanf(%d, &aij);for (i = 0; i 4; i+)for (j = 0; j 4; j+)scanf(%d, &bij);scanf(%d, &n);for (i = 0; i 4; i+)for (j = 0; j 4; j+)if (bij = 1)xk

15、= i; yk = j; k+;while (1)for (i = 0; i 4; i+)if (axi + downyi + n - 1 = 0)count+;if (count = 4)down+; count = 0;else最新資料推薦12if (xi + down = 14)for (j = 0; j 4; j+)axj + downyj + n - 1 = 1;break;elsefor (j = 0; j 4; j+)axj + down - 1yj + n - 1 = 1;break;for (i = 0; i 15; i+)for (j = 0; j 10; j+)print

16、f(%d , aij);printf(n);return 0;題17:最大波動#include#includeint main()int i, n,t=0;int a1001 = 0 ;scanf(%d, &n);for (i = 0; i n; i+)scanf(%d, &ai);for (i = 0; i n-1; i+)if (t abs(ai - ai + 1)t = abs(ai - ai + 1);printf(%d, t);return 0;題18:火車購票#includeint main()int i, j, n, t,k;int flag;int a100 =

17、 0 ;最新資料推薦13int b20 = 0;scanf(%d, &n);for (i = 0; i 20; i+)bi = 5;for (i = 0; i n; i+)scanf(%d, &t);flag = 0;for (j = 0; j = t) /有連續(xù)座位for (k = 1; k 0) /無連續(xù)座位且有人買票for (j = 0; j = 1) /分散買票printf(%d , j * 5 + (5 - bj) + 1);t-;bj-;printf(n); /注意換行的情況return 0;題19:中間數(shù)#includeint main()int i,j,n,zu

18、o,you;int t = -1;int a1001;scanf(%d, &n);for (i = 0; i n; i+)scanf(%d, &ai);for (i = 0; i n; i+)zuo = 0; /注意初始化you = 0;最新資料推薦14for (j = 0; j aj)zuo+;if (ai aj)you+;if (zuo = you)t = ai;printf(%d, t);return 0;題20:工資計算#includeint main()int i, t;int x = 0;scanf(%d, &t);if (t = 3500)printf(%

19、d, t);for (i = 3600; i = 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 i, n, k;int sum = 0, t = 0;int a1001; scanf(

20、%d%d, &n, &k);for (i = 0; i n; i+)scanf(%d, &ai);最新資料推薦16for (i = 0; i =k)t+;sum = 0;else if (i = n - 1) /t+;printf(%d, t); return 0;題22:學(xué)生排隊#includeint main()int i, j, n, m;int p, q, k;scanf(%d%d, &n, &m);int a1001 = 0 ;for (i = 1; i = n; i+)ai = i;for (i = 1; i = m; i+)scanf(%d

21、%d, &p, &q);for (j = 1; j = n; j+)if (aj = p)break; /注意中斷if (q = q; k-) /aj + k + 1 = aj + k;aj + q = p;else if (q 0)for (k = 0; k q; k+)aj + k = aj + k + 1;aj + q = p;for (i = 1; i = n; i+)printf(%d , ai);return 0;注意這里的else if注意循環(huán)移動數(shù)組中的元素最新資料推薦17題23:打醬油#includeint main()int N, t = 0; scanf(

22、%d, &N);if (N 30)t = N / 10;else if (N 50)t = (N - 30) / 10 + 4;elset = (N / 50) * 7 + (N - (N / 50) * 50) / 30) * 4 + (N - (N / 50) * 50 - (N - (N/ 50) * 50)/30)*30) / 10;/注意計算printf(%d, t);return 0;最新資料推薦18題24:公共鑰匙盒#include struct seq int key;int action;int time;int main()int num, order;int i

23、= 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 num; i+)keysi = i + 1;for (i = 0; i order; i+)scanf(%d%d%d, &w, &s, &c); arr2 * i.key = w; arr2 * i.action = 0; arr2 * i.time = s;arr2 * i + 1.key = w; arr2 * i

24、+ 1.action = 1; arr2 * i + 1.time = s + c;for (i = 0; i order * 2; i+)for (j = i + 1; j arrj.time)temp = arri; arri = arrj; arrj = temp;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 order * 2; i+)if (arri.action = 0)最新資料推薦19for (j = 0; j num; j+)if (keysj = arri.key)keysj = 0; break;elsefor (j = 0; j num; j+)if (keysj = 0)keysj = arri.key;break;for (i = 0

溫馨提示

  • 1. 本站所有資源如無特殊說明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請下載最新的WinRAR軟件解壓。
  • 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶所有。
  • 3. 本站RAR壓縮包中若帶圖紙,網(wǎng)頁內(nèi)容里面會有圖紙預(yù)覽,若沒有圖紙預(yù)覽就沒有圖紙。
  • 4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
  • 5. 人人文庫網(wǎng)僅提供信息存儲空間,僅對用戶上傳內(nèi)容的表現(xiàn)方式做保護(hù)處理,對用戶上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對任何下載內(nèi)容負(fù)責(zé)。
  • 6. 下載文件中如有侵權(quán)或不適當(dāng)內(nèi)容,請與我們聯(lián)系,我們立即糾正。
  • 7. 本站不保證下載資源的準(zhǔn)確性、安全性和完整性, 同時也不承擔(dān)用戶因使用這些下載資源對自己和他人造成任何形式的傷害或損失。

評論

0/150

提交評論