輸入四個整數(shù).doc

1. 輸入四個整數(shù)，要求按從大到小的順序輸出。#include main() int t,a,b,c,d; printf(請輸入4個整數(shù)：); scanf(%d,%d,%d,%d,&a,&b,&c,&d); printf(n a=%d,b=%d,c=%d,d=%dn,a,b,c,d); if(ab) t=a; a=b; b=t; if(ac) t=a; a=c; c=t; if(ad) t=a; a=d; d=t; if(bc) t=a; b=c; c=t; if(bd) t=b; b=d; d=t; if(cd) t=c; c=d; d=t; printf(排序結(jié)果如下：n); printf(%d, %d, %d, %dn,a,b,c,d); 2. 打印出大于1000的第一對雙生質(zhì)數(shù)。#include#includemain()long int flag=0,n,m,k;printf(nThe first twin prime numner which is larger than 1000 is:n);for(m=1001;m+=2)k=sqrt(m);flag=0;for(int j=3;j=k&flag=0;j+=2)if(m%j=0)flag=1;if(flag=0)n=m+2;k=sqrt(n);for(int j=3;j=k;j+=2)if(n%j=0)flag=1;if(flag=0)printf(n%1d and %1d,m,n);break;3. 打印出前n個質(zhì)數(shù)。#include#includemain()int count,flag=0,n,i,k;printf(nenter an integer n:);scanf(%d,&n);printf(nThe first %d prime numners are:n,n);printf(2t);count=1;i=3;while(1)k=sqrt(i);flag=0;for(int j=3;j=k&flag=0;j+=2)if(i%j=0)flag=1;if(flag=0)printf(%dt,i);count+;if(count=n)break;elsei+=2;4. 九九乘法表。#includeint main()int i,j;printf(nn The list is:nn);for(i=1;j10;i+)for(j=1;j=i;j+)printf(%d*%d=%d,j,i,i*j);printf(nn);return 0;5. 判斷n是否是素數(shù)。#include#includemain()int j,k,n;scanf(%d,&n);k=sqrt(n);for(j=2;jk)printf(%d是素數(shù),n);6求1！+2！+3！+、+20！。#includemain() int n,i=1;long sum=0,s=1; scanf(%d,&n); while(i=n) s=s*i;sum=sum+s;i+; printf(sum=%ldn,sum); 7. 求m到n之間的全部素數(shù)。#include#includemain()int m,n,k,flag=0;printf(nEnter two integers m,n:);scanf(%d,%d,&m,&n);printf(nthe prime numbers from %d to %d are:n,m,n);for(int i=m;i=n;i+)if(i=2)printf(%dt,i);else if(i%2=0)continue;elsek=sqrt(i);flag=0;for(int j=3;j=k&flag=0;j+=2)if(i%j=0)flag=1;if(flag=0)printf(%dt,i);8. 輸出矩陣。#includeint main()int i,j,n=0;for(i=1;i=4;i+)for(j=1;j=5;j+,n+) if(n%5=0) printf (n);printf(%dt,i*j);printf(n);return 0;9. 顯示ASCII碼為30到119的字符。#includeint main()int i,n=0;printf(nn);for(i=30;i0)printf(n);printf(%3d:%c,i,i);n+;printf(n);return 0;10. 用選擇法對十個整數(shù)從小到大排序。#includemain() int i,j,a10,t; for(i=0;i10;i+) scanf(%d,&ai); for(j=1;j10;j+) for(i=0;iai+1) t=ai+1;ai+1=ai;ai=t; for(i=0;i10;i+) printf(%5d,ai); 11. 用輾轉(zhuǎn)相除法求m與n的最大公約數(shù)。#includeint main()int r,m,n;printf(Enter m,n=);scanf(%d%d,&m,&n);printf(%d,%d)=,m,n);if(mn) r=m;m=n;n=r;r=m%n;while(r!=0)m=n;n=r;r=m%n;printf(%dn,n);return 0;12. 整數(shù)的質(zhì)因數(shù)分解。#include#includemain()int n,flag1=0,flag2=0;int i,j;printf(nEnter an integer n(=3):);scanf(%d,&n);printf(nnt%d=,n);while(n!=1)for(i=2;i=n;i+)if(n%i=0)flag2=0;for(j=2;j=sqrt(i);j+)if(i%j=0)flag2=1;break;if(flag2=0)if(flag1=0)flag1=0;printf(%d,i);elseprintf(%d,i);n=n/i;break;13. 正弦函數(shù)。（1）#include#define pi 3.1415int main()float x,v,u,sum;int i=2,n,sign=-1;printf(nEnter n,x:);scanf(%d,%f,&n,&x);v=x;u=1;sum=x;for(i=2;i=n;i+)v=v*x*x;u=u*(2*i-2)*(2*i-1);sum+=sign*v/u;sign=-sign;printf(nsin(%f)=%.4f,x,sum);return 0;（2）#include#define pi 3.1415main()float x,term,sum;int i=2,n;printf(nEnter n,x:);scanf(%d,%f,&n,&x);while (x2*pi)x=x-2*pi;sum=x;term=x;for (i=2;i=n;i+)term=-term*x/(2*i-1)*x/(2*i-2);sum+=term;printf(nsin(%f)=%.4f,x,sum);(3)#include#include#define pi 3.1415main()float x,w,term,sum;int i=2