西工大C語(yǔ)言上機(jī)考試題庫(kù)_第1頁(yè)
西工大C語(yǔ)言上機(jī)考試題庫(kù)_第2頁(yè)
西工大C語(yǔ)言上機(jī)考試題庫(kù)_第3頁(yè)
西工大C語(yǔ)言上機(jī)考試題庫(kù)_第4頁(yè)
西工大C語(yǔ)言上機(jī)考試題庫(kù)_第5頁(yè)
已閱讀5頁(yè),還剩50頁(yè)未讀, 繼續(xù)免費(fèi)閱讀

下載本文檔

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

文檔簡(jiǎn)介

1、精選1:2:3#include<stdio.h>#include<math.h>int main() int i=0,j=0,k=0,a=0,b=0,c=0,l=0,m=0,n=0,d=0,p=0,q=0; for(i=1;i<=3;i+) for(j=1;j<=9;j+) if(i!=j) for(k=1;k<=9;k+) 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; n=b/100,q=c/100; if(

2、l!=0&&m!=0&&n!=0&&d!=0&&p!=0&&q!=0) if(i!=l&&i!=m&&i!=n&&j!=l&&j!=m&&j!=n&&k!=l&&k!=m&&k!=n) if(i!=d&&i!=p&&i!=q&&j!=d&&j!=p&&j!=q&&k!=d&&k!

3、=p&&k!=q) if(l!=d&&l!=p&&l!=q&&m!=d&&m!=p&&m!=q&&n!=d&&n!=p&&n!=q) printf("%d %d %dn",a,b,c); return 0;8#include"stdio.h"int main() int a,b10,m=0,n=0,p; int i,j,k; scanf("%d",&a); for(i=1;i<=

4、a;i+) m=0; n=0; p=i; for(j=0;p!=0;j+) bj=p%10; p=p/10; for(k=0;k<j;k+) m=m+bk; if(bk=8) n=1; if(m%8=0) printf("%d ",i); continue; if(i%8=0) printf("%d ",i); continue; if(n=1) printf("%d ",i); continue; return 0;8的次數(shù)A*B#include <stdio.h>#include <string.h>

5、#include <stdlib.h>void cheng(char a,char b) int i,j,ca,cb,*s; ca=strlen(a); cb=strlen(b); s=(int *)malloc(sizeof(int)*(ca+cb); for (i=0;i<ca+cb;i+) si=0; for (i=0;i<ca;i+) for (j=0;j<cb;j+) si+j+1+=(ai-'0')*(bj-'0'); for (i=ca+cb-1;i>=0;i-) if (si>=10) si-1+=si/

6、10; si%=10; i=0; while(si=0) i+; for (;i<ca+cb;i+) printf("%d",si); printf("n"); free(s);int main() char a100,b100; gets(a),gets(b); if(a0='-'&&b0!='-') printf("-"); cheng(&a1,b); else if(a0='-'&&b0='-') cheng(&

7、a1,&b1); else if(a0!='-'&&b0='-') printf("-"); cheng(a,&b1); else cheng(a,b); return 0;N邊形面積#include<stdio.h>#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);printf(&quo

8、t;%.2lfn",s);return 0;參與競(jìng)賽#include<stdio.h>int main() int a,b,c,d,e; for(a=0;a<2;a+) for(b=0;b<2;b+) for(c=0;c<2;c+) 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&

9、;&d=0) &&(!(d=0&&e=0) &&(e=1&&a=1&&d=1)|(e=0) if(a=1)printf("A "); if(b=1)printf("B "); if(c=1)printf("C "); if(d=1)printf("D "); if(e=1)printf("E "); return 0;草坪噴水插入排序#include<stdio.h>void sort(int a

10、,int n)int i;int k;int t;for(i=1;i<n;i+)t=ai;k=i-1;while(t<ak)ak+1=ak;k-;if(k=-1)break;ak+1=t;int main()int n;int a100;int i;scanf("%d",&n);for(i=0;i<n;i+)scanf("%d",&ai);sort(a,n);printf("n");for(i=0;i<n;i+)if(i=n-1)printf("%dn",ai);else p

11、rintf("%d ",ai);return 0;查找車(chē)牌號(hào)#include<stdio.h>#include<math.h>int main()int i,j,n;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;成果轉(zhuǎn)化乘完倒序尺子刻度大數(shù)除法大數(shù)減法#include <stdio.h>#include <string.h>#

12、define max(a,b) a>b?a:b#define min(a,b) a>b?b:aint sum101;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(i<=lenmin) sumlenmax-i=alen1-i+blen2-i-'0'-'0'+flag

13、; if(sumlenmax-i>=10) sumlenmax-i=sumlenmax-i-10; flag=1; else flag=0; else if(len1>len2) sumlenmax-i=alen1-i-'0'+flag; if(sumlenmax-i>=10) sumlenmax-i=sumlenmax-i-10; flag=1; else flag=0; else sumlenmax-i=blen2-i-'0'+flag; if(sumlenmax-i>=10) sumlenmax-i=sumlenmax-i-10;

14、flag=1; else flag=0; if(flag=1) printf("1"); for(i=0;i<lenmax;i+) printf("%d",sumi); printf("n");void jian(char a,char b) int flag=0,i; int len1,len2; len1=strlen(a),len2=strlen(b); for(i=1;i<=len1;i+) if(i<=len2) if(alen1-i-blen2-i-flag>=0) sumlen1-i=alen1-

15、i-blen2-i-flag; flag=0; else sumlen1-i=alen1-i-blen2-i-flag+10; flag=1; else if(alen1-i-flag-'0'>=0) sumlen1-i=alen1-i-flag-'0' flag=0; else sumlen1-i=alen1-i-flag+10-'0' flag=1; for(i=0;i<len1&&sumi=0;i+); for(;i<len1;i+) printf("%d",sumi); printf(

16、"n");void compare(char a,char b) int len1,len2; len1=strlen(a),len2=strlen(b); if(len1>len2|(len1=len2&&strcmp(a,b)>0) jian(a,b); else if(strcmp(a,b)!=0) printf("-"); jian(b,a); else printf("0n");int main() char a100,b100; gets(a); gets(b); if(a0='-

17、9;&&b0!='-') printf("-"); jia(&a1,b); else if(a0='-'&&b0='-') compare(&b1,&a1); else if(a0!='-'&&b0='-') jia(a,&b1); else compare(a,b); return 0;大寫(xiě)變小寫(xiě)#include<stdio.h>#include<string.h>int main()cha

18、r s80;int len,i; gets(s); len=strlen(s); for(i=0;i<len;i+) if(si>='a'&&si<='z') si=si-32; puts(s);return 0;到底星期幾等比數(shù)列#include <stdio.h>#include <stdlib.h>int main() int m,n,sum; scanf ("%d",&m); for (n=1; ;n+)sum=(3*n-1)*n/2;if (sum>m)brea

19、k;printf ("%d",n); return 0;分?jǐn)?shù)#include<stdio.h>int main()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/%dn",k,x,y);return 0;韓信點(diǎn)兵#include<stdio.h>int main()int n,i;for (i=0

20、;i+) if (i%5=2&&i%6=3&&i%7=4&&i%11=5) printf("%d",i);break;return 0;回文字符串#include<stdio.h>#include<string.h>#include<ctype.h>#define MAXN 5000+10char bufMAXN,sMAXN;int pMAXN;int main() int n,m=0,max=0,x,y; int i,j; fgets(buf,sizeof(s),stdin); n=str

21、len(buf); for(i=0;i<n;i+) if(isalpha(bufi) pm=i; sm+=toupper(bufi); for(i=0;i<m;i+) for(j=0;i-j>=0&&i+j<m;j+) if(si-j!=si+j)break; if(j*2+1>max)max=j*2+1;x=pi-j;y=pi+j; for(j=0;i-j>=0&&i+j+1<m;j+) if(si-j!=si+j+1)break; if(j*2+2>max)max=j*2+2;x=pi-j;y=pi+j+1;

22、for(i=x;i<=y;i+) printf("%c",bufi);printf("n");return 0;#include<iostream>using namespace std;int main() char A5000,B5000; int a=0,b,c,d,e,f,n=0,m,p,q,C5000; while(Aa=cin.get()!='n') a+; for(b=0,c=0;b<=a-1;b+) if(Ab>=65&&Ab<=90)|(Ab>=97&&a

23、mp;Ab<=122) Bc=Ab,Cc=b; if(Bc>=97&&Bc<=122) Bc=Bc-32; c+; Bc=32; for(d=0;d<=c-2;d+) if(Bd=Bd+1) e=d,f=d+1,a=1; else if(Bd=Bd+2) e=d,f=d+2,a=1; else continue; while(e-1>=0&&f+1<=c&&Be-1=Bf+1) e-,f+; m=f-e; if(m>n) n=m,p=e,q=f; for(a=Cp;a<=Cq;a+) cout<

24、;<Aa; cout<<endl;雞的體重計(jì)算數(shù)據(jù)整數(shù)部分加密#include<stdio.h>#include<string.h>int main()FILE*pi;pi=fopen("in.dat","w");char A1000,B1000;int i,n;gets(A);n=strlen(A);for(i=0;i<n;i+)fprintf(pi,"%c",Ai);if('A'<=Ai<'Z'|'a'<=Ai<

25、'z')Bi=Ai+1;if(Ai='Z'|Ai='z')Bi=Ai-25;for(i=0;i<n;i+)printf("%c",Bi);fclose(pi);return 0;階乘#include<stdio.h>int main()int n;int i=2;int j=1;scanf("%d",&n);while(1)j=j*i;if(j>n) break;i+;printf("%dn",i-1);return 0;卡片恐怖水母#include<

26、;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+)if(Ai<Aj) n=Aj; Aj=Ai; Ai=n; int main() int n=0,m=0,A100=0,B100=0,i=0,j=0,k=0; scanf("%d%d",&n,&m);for(i=0;i<n;i+) scanf("%d",&Ai);for(i=0;i<m;i+) scanf("%d",&a

27、mp;Bi);if(m<n)printf("NULLn");else paixu(A,n);paixu(B,m); for(i=0;i<m;i+) if(A0<=Bi) if(m-i>=n) for(k=0;k<n;k+) j+=Bi+k; printf("%dn",j); else printf("NULLn");break;return 0;快速排序#include<stdio.h> void QuickSort(int A,int n,int L,int R) int i,j,t;if(

28、L<R)i=L;j=R+1;while(1)while(i+1<n&&A+i<AL);while(j-1>-1&&A-j>AL);if(i>=j)break;t=Ai;Ai=Aj;Aj=t;t=AL,AL=Aj,Aj=t;QuickSort(A,n,L,j-1);QuickSort(A,n,j+1,R);int main()int A1000,n,i,j,p;scanf("%d",&n);if(n>=1000) printf("Overflow!") ;return 0;

29、/輸入要排序的元素的數(shù)目,若大于1000則結(jié)束程序輸出“Overflow!”for(i=0;i<n;i+)scanf("%d",&Ai); /輸入元素QuickSort(A,n,0,n-1);for(i=n-1;i>=0;i-)printf("%d ",Ai); /輸出排序好的結(jié)果 return 0;兩人三足#include<stdio.h>int main()int n,a50,i,j,t,sum=0;scanf("%dn",&n);for (i=0;i<n;i+) scanf(&quo

30、t;%d",&ai);for (i=0;i<n;i+) for (j=0;j<n-i-1;j+) if (aj<aj+1) t=aj,aj=aj+1,aj+1=t;for (i=0;i<n;i+=2) sum+=ai;printf("%d",sum);return 0;逆序輸出偶數(shù)和#include <stdio.h>#include <stdlib.h>int main() int n,i,sum=0; scanf("%d",&n); int an; for(i=0;i<n

31、;i+) scanf("%d",&ai); for(i=0;i<n;i+) if(i%2=0)sum=sum+ai;printf("%d",sum); return 0;三角形面積士兵移動(dòng)輸出位數(shù)#include<stdio.h>int main()int i,n;scanf("%d",&n);for(i=1;i+)if(n/10=0)break;else n=n/10;printf("%d",i);數(shù)列#include<stdio.h>int main()int A1

32、0,B5,i;double C5;for(i=0;i<5;i+)scanf("%d",&Ai);for(i=0;i<4;i+)Bi=Ai+1-Ai;Ci=(double)Ai+1/Ai; if(B0=B1&&B1=B2&&B2=B3)for(i=5;i<10;i+) Ai=Ai-1+B0,printf("%d ",Ai);return 0; if(C0=C1&&C1=C2&&C2=C3)for(i=5;i<10;i+) Ai=Ai-1*C0,printf(&q

33、uot;%d ",Ai); return 0; if(A0+A1=A2)&&(A1+A2=A3)&&(A2+A3=A4)for(i=5;i<10;i+)Ai=Ai-1+Ai-2,printf("%d ",Ai); return 0; printf("NULL");return 0;數(shù)字加密數(shù)組元素和水仙花數(shù)提取字符串#include <stdio.h>#include<string.h>int main()char A100;char l100;gets(A);int m,n,i,j

34、;scanf("%d",&m);n=strlen(A);for (i=m;i<n;i+)li=Ai;for (j=m;j<n;j+)printf("%c",lj);printf("n");return 0;添加行號(hào)#include<stdio.h>#include<string.h>int main()char A3100,B3100;int i;FILE*fp;fp=fopen("b.c","w");for(i=0;i<3;i+)gets(Ai

35、);fprintf(fp,"0001 ");fputs(A0,fp);fprintf(fp,"n""0002 ");fputs(A1,fp);fprintf(fp,"n""0003 ");fputs(A2,fp);fprintf(fp,"n");fclose(fp);printf("0001 ");puts(A0);printf("0002 ");puts(A1);printf("0003 ");puts(A2);r

36、eturn 0;舞伴配對(duì)相乘后位數(shù)相加#include <stdio.h>int main()int k;long a,b;scanf("%ld%ld",&a,&b);if(a=0|b=0)printf("0n");elsek=(a%9)*(b%9)%9;if(k=0)printf("9n");elseprintf("%dn",k);return 0;#include <iostream>using namespace std;int main() char A13,B13;

37、 int a=0,b=0,c,d,e,f,m=0,X13,Y13; for(c=0;c<=12;c+) Xc=0,Yc=0; while(Aa=cin.get()!=32) a+; while(Bb=cin.get()!='n') b+; for(c=0,a-;a>=0;a-,c+) Xc=Aa-48; for(d=0,b-;b>=0;b-,d+) Yd=Bb-48; for(e=0;e<=c-1;e+) for(f=0;f<=d-1;f+) m=m+Xe*Yf; while(m>10) a=m%10,m=(m-a)/10+a; cout&l

38、t;<m<<endl; return 0;銷(xiāo)售記錄#include<stdio.h>#include<string.h>typedef struct tagME char a05; char a111; char a220; int a3; int a4;tag;int main() tag a100,b100; int n,i,j=1,k=0; FILE *fp; scanf("%d",&n); for(i=0;i<=n-1;i+) scanf("%s %s %s %d %d",ai.a0,ai.

39、a1,ai.a2,&ai.a3,&ai.a4); fp=fopen("out.dat","w"); if(fp!=NULL) for(j=0;j<=n-1;j+) fscanf(fp,"%s%s%s%d%d",aj.a0,aj.a1,aj.a2,&aj.a3,&aj.a4); for(i=0;i<=n-2;i+)if(ai.a4>=ai+1.a4)b0=ai,ai=ai+1,ai+1=b0; printf("%s %s %s %d %d",ai.a0,ai.a1,a

40、i.a2,ai.a3,ai.a4); fclose(fp); return 0; 星期幾星座#include <stdio.h>int main()int a,b;scanf("%d%d",&a,&b);switch (a)case 1:if(b<=19)printf("Capricorn"); else printf("Aquarius");break; case 2:if(b<=18)printf("Aquarius"); else printf("Pisces

41、");break;case 3:if(b<=20)printf("Pisces"); else printf("Aries");break;case 4:if(b<=20)printf("Aries"); else printf("Taurus");break;case 5:if(b<=20)printf("Taurus"); else printf("Gemini");break;case 6:if(b<=21)printf("G

42、emini"); else printf("Cancer");break;case 7:if(b<=22)printf("Cancer"); else printf("Leo");break;case 8:if(b<=22)printf("Leo"); else printf("Virgo");break;case 9:if(b<=22)printf("Virgo"); else printf("Libra");break;ca

43、se 10:if(b<=22)printf("Libra"); else printf("Scorpio");break;case 11:if(b<=21)printf("Scorpio"); else printf("Sagittarius");break;case 12:if(b<=21)printf("Sagittarius"); else printf("Capricorn");break;return 0;幸運(yùn)數(shù)學(xué)號(hào)循環(huán)移位#include <

44、;stdio.h>int move(int value,int n) if(n<0) n=-n; value=(value<<n|value>>(32-n); else value=(value>>n|value<<(32-n); return(value);int main() int x,y; scanf("%d %d",&x,&y); printf("%dn",move(x,y); return 0;月份天數(shù)#include <stdio.h>int main() int y,m,d; int A13=0,31,29,31,30,31,30,31,31,30,31,30,31; int B13=0,31,28,31,30,31,30,31,31,30,31,30,31; scanf("%d%d",&y,&m); if

溫馨提示

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

評(píng)論

0/150

提交評(píng)論