



版權(quán)說明:本文檔由用戶提供并上傳,收益歸屬內(nèi)容提供方,若內(nèi)容存在侵權(quán),請進行舉報或認(rèn)領(lǐng)
文檔簡介
1、題 1:出現(xiàn)次數(shù)最多的數(shù)#include<stdio.h>intmain()inti,j, n, s;int t = 1;inta10001 = 0;scanf("%d", &n);for (i = 0; i< n; i+)scanf("%d", &s); /下標(biāo)為輸入值,每個數(shù)組值為輸入頻數(shù)as+;if (as > at) t=s;if (as = at) t=(s<t? s:t);printf("%d", t);return 0;題 2: ISBN 號碼#include<stdi
2、o.h>intmain()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(sum%11 = a12-
3、39;0')|(sum%11=10&&a12='X') /注意正確情況幾種類型printf("Right");elseif (sum%11 = 10)a12 = 'X'elsea12 = sum%11 + '0'puts(a);return 0;題 3:相反數(shù)#include<stdio.h>intmain()inti, j, n,t=0;inta501;scanf("%d", &n);for (i = 0; i< n; i+)scanf("%d&
4、quot;, &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:窗口#include<stdio.h>typedef struct window1int x1,x2,y1,y2,order; window;void Inputwindow(window ws,int n)inti;for(i=1;i<=n;i+)scanf("%d%d%d%d",&wsn-
5、i.x1,&wsn-i.y1,&wsn-i.x2,&wsn-i.y2); wsn-i.order=i;intgetpos(window ws,intn,intx,int y)inti;for(i=0;i<n;i+)if(x>=wsi.x1&&x<=wsi.x2&&y>=wsi.y1&&y<=wsi.y2)return i;return -1;void movewindow(window ws,intn,intpos)window w=wspos;inti;for(i=pos-1;i>=0
6、;i-)wsi+1=wsi;ws0=w;intmain()inti,n,m,x,y,pos;scanf("%d%d",&n,&m);window wsn;Inputwindow(ws,n);for(i=0;i<m;i+)scanf("%d%d",&x,&y);pos=getpos(ws,n,x,y);if(pos=-1)printf("IGNOREDn");elseprintf("%dn",wspos.order);movewindow(ws,n,pos);return 0;題
7、 5:相鄰數(shù)對#include<stdio.h>#include<math.h>intmain()inti, j, n,t=0;inta1001;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:畫圖#includ
8、e<stdio.h>intmain()inti, j, n,k, t = 0;inta1014;scanf("%d", &n);for (i = 0; i< n; i+)scanf("%d%d%d%d", &ai0, &ai1, &ai2, &ai3);for (i = 0; i< 101; i+)for (j = 0; j < 101; j+)for (k = 0; k < n; k+)if (j >= ak0 && j <ak2 &&
9、;i>= ak1 &&i<ak3)break;if (k < n)t+;printf("%d", t);return 0;題 7:門禁系統(tǒng)#include<stdio.h>intmain()inti, n, s = 0;inta1001 = 0 ;scanf("%d", &n);for (i = 0; i< n; i+)scanf("%d", &s);as+;printf("%d ", as);return 0;題 8: z 字形掃描#includ
10、e<stdio.h>intmain()inti, j, k, n;inta500500;scanf("%d", &n);for (i = 0; i<n; i+)for (j = 0; j<n; j+)scanf("%d", &aij);for (k = 0; k<2 * n - 1; k+)for (i = 0; i<n; i+)for (j = 0; j<n; j+)if (i + j = k)if (k % 2 = 0)printf("%d ", aji);elseprin
11、tf("%d ", aij);return 0;題 9:圖像旋轉(zhuǎn)#include<stdio.h>#define N 1000int aNN;intmain()inti, 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(&q
12、uot; ");printf("%d", aim - j);printf("n");return 0;題 10:數(shù)字排序#include<stdio.h>intmain()inti, j, n,s=0;int a1001 = 0; /注意初始化賦值scanf("%d", &n);for (i = 0; i< n; i+)scanf("%d", &s);as+;for (i = 1001; i>0; i-)/i為從后找起的頻數(shù)for (j = 0; j <100
13、1; j+) /數(shù)組下標(biāo)從小到大if (aj = i)/找自己printf("%d %dn", j, aj);return 0;題 11:數(shù)列分段#include<stdio.h>intmain()inti, n,t=0;inta1001;scanf("%d", &n);for (i = 0; i< n; i+)scanf("%d", &ai);for (i = 0; i< n - 1; i+)if (ai != ai + 1) t+;printf("%d", t + 1);
14、return 0;題 12:日期計算#include<stdio.h>intmain()int y, d, day, i;intmouth13 = 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<13; i+)if (d > mouthi)d = d - mouthi;if (d = 0)d = mouthi;b
15、reak;else break; /注意中斷,確保月份不出錯printf("%dn%d", i, d);return 0;題 13:數(shù)位之和#include<stdio.h>intmain()int n, sum = 0;scanf("%d", &n);while (n)sum = sum + n%10;n = n / 10;printf("%d", sum);return 0;題 14:消除類游戲#include<stdio.h>intmain()inti, j,k, n, m,t=1;inta313
16、1 = 0 ;intb3131 = 0 ;scanf("%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 < m; j+)while (aij = aij + 1) /check行j+;if (j = m) break;t+;if (t >= 3)for (k = j - t + 1; k <= j; k+)bik = 1;t
17、 = 1;for (j = 0; j < m; j+)for (i = 0; i< n; i+)while (aij = ai+1j) /check列i+;if (i = n) break;t+;if (t >= 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) aij = 0; /將找到的賦0for (i = 0; i< n; i+)for (j = 0; j < m; j+)printf(&quo
18、t;%d ", aij);printf("n");return 0;題 15:折點計數(shù)#include<stdio.h>intmain()inti, n,t=0;inta1001;scanf("%d", &n);for (i = 0; i< n; i+)scanf("%d", &ai);for (i = 0; i< n-2; i+)if (ai + 1 < ai && ai + 1 < ai + 2) | (ai + 1 > ai &&
19、 ai + 1 > ai + 2) t+;printf("%d", t);return 0;題 16:俄羅斯方塊#include<stdio.h>intmain()inti, j, n;int k = 0,count=0,down=0;intx4, y4;inta1510;intb44;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
20、("%d", &bij);scanf("%d", &n);for (i = 0; i< 4; i+)for (j = 0; j < 4; j+)if (bij = 1)xk = 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;elseif (xi + down = 14)for (j = 0; j < 4; j+)axj + downyj + n -
21、 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+)printf("%d ", aij);printf("n");return 0;題 17:最大波動#include<stdio.h>#include<math.h>intmain()inti, n,t=0;inta1001 = 0 ;scanf("%d", &
22、amp;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:火車購票#include<stdio.h>intmain()inti, j, n, t,k;int flag;inta100 = 0 ;intb20 = 0;scanf("%d", &n);for (i =
23、0; i< 20; i+)bi = 5;for (i = 0; i< n; i+)scanf("%d", &t);flag = 0;for (j = 0; j < 20; j+)if (bj >= t) /有連續(xù)座位for (k = 1; k <= t; k+)printf("%d ", j * 5 + (5 - bj) + k);printf("n");bj = bj - t;flag = 1;break;if(flag=0&&t>0) /無連續(xù)座位且有人買票for (j
24、= 0; j < 20; j+)while (bj >= 1) /分散買票printf("%d ", j * 5 + (5 - bj) + 1);t-;bj-;printf("n");/注意換行的情況return 0;題 19:中間數(shù)#include<stdio.h>intmain()inti,j,n,zuo,you;int t = -1;inta1001;scanf("%d", &n);for (i = 0; i< n; i+)scanf("%d", &ai);for
25、 (i = 0; i< n; i+)zuo = 0; /注意初始化you = 0;for (j = 0; j < n; j+) /注意j 的范圍if (ai > aj)zuo+;if (ai < aj)you+;if (zuo = you)t = ai;printf("%d", t);return 0;題 20:工資計算#include<stdio.h>intmain()inti, t;int x = 0;scanf("%d", &t);if (t <= 3500)printf("%d"
26、;, t);for (i = 3600; i<= 100000; i = i + 100)if (i>= 3600 &&i<= 5000)x += (i - 3500)*0.03;if (i>= 5100 &&i<= 8000)x += (i - 5000)*0.1 + 45;if (i>= 8100 &&i<= 12500)x += (i - 8000)*0.2 + 45 + 300;if (i>= 12600 &&i<= 38500)x += (i - 12500)*0.2
27、5 + 45 + 300 + 900;if (i>= 38600 &&i<= 58500)x += (i - 38500)*0.3 + 45 + 300 + 900 + 6500;if (i>= 58600 &&i<= 83500)x += (i - 58500)*0.35 + 45 + 300 + 900 + 6500 + 6000;if (i>= 83600)x += (i - 83500)*0.45 + 45 + 300 + 900 + 6500 + 6000 + 8750;if (i - x = t)printf("
28、;%d", i);break;return 0;題 21:分蛋糕#include<stdio.h>intmain()inti, n, k;int sum = 0, t = 0;inta1001;scanf("%d%d", &n, &k);for (i = 0; i< n; i+)scanf("%d", &ai);for (i = 0; i< n; i+)sum = sum + ai;if (sum>=k)t+;sum = 0;else if (i = n - 1) /注意這里的else if
29、t+;printf("%d", t);return 0;題 22:學(xué)生排隊#include<stdio.h>intmain()inti, j, n, m;int p, q, k;scanf("%d%d", &n, &m);inta1001 = 0 ;for (i = 1; i<= n; i+)ai = i;for (i = 1; i<= m; i+)scanf("%d%d", &p, &q);for (j = 1; j <= n; j+)if (aj = p)break;
30、/注意中斷if (q < 0)for (k = -1; k >= q; k-) /注意循環(huán)移動數(shù)組中的元素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;題 23:打醬油#include<stdio.h>intmain()int N, t = 0;scanf("%d",
31、 &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;題 24:公共鑰匙盒#include <stdio.h>struct seq int key;int action;int time;in
32、tmain()intnum, order;inti = 0, j = 0;int w = 0, s = 0, c = 0;scanf("%d%d", &num, &order);int keysnum;struct seqarrorder * 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 =
33、0;arr2 * i.time = s;arr2 * i + 1.key = w;arr2 * i + 1.action = 1;arr2 * i + 1.time = s + c;for (i = 0; i< order * 2; i+)for (j = i + 1; j < order * 2; j+)if (arri.time>arrj.time)temp = arri;arri = arrj;arrj = temp;else if (arri.time = arrj.time)if (arri.action = 0 &&arrj.action = 1)
34、temp = arri;arri = arrj;arrj = temp;elseif(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)for (j = 0; j <num; j+)if (keysj = arri.key)keysj = 0;break;elsefor (j = 0; j <num; j+)if (keysj = 0)keysj =
35、 arri.key;break;for (i = 0; i< order * 2; i+)printf("%d %d %dn", arri.key, arri.action, arri.time);for (i = 0; i<num; i+)printf("%d ", keysi);return 0;題 25:最小差值#include<stdio.h>#include<math.h>intmain()inti, j, n,t;inta1001 = 0 ;scanf("%d", &n);for
36、 (i = 0; i< n; i+)scanf("%d", &ai);t = 999; / 注意 t 賦一個較大值,因為 2<=n<=1000, 差值最大為 998 for (i = 0; i< n - 1; i+)for (j = i + 1; j < n; j+)if (t > abs(ai - aj)t = abs(ai - aj);printf("%d", t);return 0;題 26:游戲#include<stdio.h>intmain()inti, n, k,t;int count
37、= 0;inta1001 = 0 ;scanf("%d%d", &n, &k);for (i = 0; i< n; i+)ai = 1;t = n;i = 0; /注意賦值while (t > 1)if (ai = 1)count+;if (count%k = 0) | (count % 10 = k)ai = 0;t-;i+;i = i%n; /圈數(shù)for (i = 0; i< n; i+)if (ai = 1)printf("%d", i + 1);return 0;題 27:跳一跳#include<stdio
38、.h>intmain()inti, 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;贈送以下資料考試知識點技巧大全一、考試中途應(yīng)飲葡萄糖水大腦是記憶的場所, 腦中有數(shù)億個神經(jīng)細(xì)胞在不停地進行著繁重的活動,大腦細(xì)胞活動需要大量能量??茖W(xué)研究證實 ,雖然大腦的重量只占人體重量的 2%-3%,但大腦消耗
39、的能量卻占食物所產(chǎn)生的總能量的20%,它的能量來源靠葡萄糖氧化過程產(chǎn)生。據(jù)醫(yī)學(xué)文獻記載 ,一個健康的青少年學(xué)生 30 分鐘用腦 ,血糖濃度在 120 毫克 /100 毫升 ,大腦反應(yīng)快 ,記憶力強; 90 分鐘用腦,血糖濃度降至 80 毫克 /100 毫升,大腦功能尚正常; 連續(xù) 120 分鐘用腦, 血糖濃度降至60 毫克 /100 毫升,大腦反應(yīng)遲鈍,思維能力較差。我們中考、高考每一科考試時間都在 2 小時或 2 小時以上且用腦強度大,這樣可引起低血糖并造成大腦疲勞,從而影響大腦的正常發(fā)揮,對考試成績產(chǎn)生重大影響。因此建議考生,在用腦 60 分鐘時,開始補飲 25%濃度的葡萄糖水100 毫升左右,為一個高效果的考試加油 。二、考場記憶“短路”怎么辦呢?對于考生來說,掌握有效的應(yīng)試技巧比再做題突擊更為有效。1.草稿紙也要逐題順序?qū)懖莞逡麧?,草稿紙使用要便?/p>
溫馨提示
- 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)方式做保護處理,對用戶上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對任何下載內(nèi)容負(fù)責(zé)。
- 6. 下載文件中如有侵權(quán)或不適當(dāng)內(nèi)容,請與我們聯(lián)系,我們立即糾正。
- 7. 本站不保證下載資源的準(zhǔn)確性、安全性和完整性, 同時也不承擔(dān)用戶因使用這些下載資源對自己和他人造成任何形式的傷害或損失。
最新文檔
- 2025年度電子商務(wù)平臺直播帶貨合作與分成協(xié)議
- 2025年度旅行社與車隊旅游專線定制運營合同模板
- 二零二五年度老年人居家護理服務(wù)保姆雇傭協(xié)議書
- 2025年度高端白酒品牌省外市場代理合同
- 二零二五年度農(nóng)村集體土地房地產(chǎn)買賣居間服務(wù)協(xié)議
- 二零二五年度戀愛雙方子女教育及成長規(guī)劃協(xié)議
- 二零二五工傷私了賠償協(xié)議書標(biāo)準(zhǔn)文本
- 二零二五年度民宿租賃合同(含民宿環(huán)保設(shè)施建設(shè))
- 2025年度超市門店整體轉(zhuǎn)讓及經(jīng)營管理權(quán)協(xié)議
- 2025年度藝術(shù)家與藝術(shù)展覽機構(gòu)合作協(xié)議
- 高中主題班會 悟哪吒精神做英雄少年-下學(xué)期開學(xué)第一課主題班會課件-高中主題班會課件
- 2025電力物資檢儲配一體化建設(shè)技術(shù)導(dǎo)則
- 新學(xué)期 開學(xué)第一課 主題班會課件
- 2025年協(xié)議離婚夫妻模板
- 福建省龍巖市2024-2025學(xué)年九年級上學(xué)期期末語文試題(解析版)
- 2025-2030年中國高爾夫產(chǎn)業(yè)規(guī)模分析及投資前景規(guī)劃研究報告
- 民法典合同編講座
- 2022國家供暖規(guī)定法規(guī)
- DBJ51-T 198-2022 四川省既有民用建筑結(jié)構(gòu)安全隱患排查技術(shù)標(biāo)準(zhǔn)
- 《干細(xì)胞及其應(yīng)用》課件
- 課題申報書:生成式人工智能提升中小學(xué)教師數(shù)字素養(yǎng)的路徑探究
評論
0/150
提交評論