《C语言模板程序(新手必看!!)》由会员分享，可在线阅读，更多相关《C语言模板程序(新手必看!!)（34页珍藏版）》请在金锄头文库上搜索。
1、C语言模板程序求两个数最大公约数方法*.辗转相除法思路：两个数，用较大的数除以较小的数，所得余数与较小的数记为新的两个数，再重复之前的过程，直到余数为0，这时较大的数就是最大公约数。完整程序#includevstdio.hintmain()intm,n,r;scanf(%d,%d,&m,&n);dor=m%n;m=n;n=r;while(n);printf(greatestcommondivisoris%dn,m);return0;封装函数intgcd(intm,intn)dor=m%n;m=n;n=r;while(n);returnm;调用函数#includevstdio.hintmain(
2、)intm,n,r;intgcd(intm,intn);scanf(%d,%d,&m,&n);gcd(intm,intn);printf(greatestcommondivisoris%dn,m);return0;C语言模板程序第#页共28页方法-.更相减损法思路：两个数，用较大的数减去较小的数，所得差与较小的数记为新的两个数，再重复之前的过程，直到两个数相等，这时这两个数就是最大公约数。完整程序#includevstdio.hintmain()intm,n;scanf(%d,%d,&m,&n);while(m!=n)if(mn)m-=n;elsen-=m;printf(greatestcom
3、mondivisoris%dn,m);return0;封装函数intgcd(intm,intn)while(m!=n)if(mn)m-=n;elsen-=m;returnm;调用函数#includevstdio.hintmain()intm,n,r;intgcd(intm,intn);scanf(%d,%d,&m,&n);printf(greatestcommondivisoris%dn,gcd(m,n);return0;求两个数最小公倍数思路：两个数，从较大的数开始，依次找能同时整除这两个数的整数，这个整数就是这两个数的最小公倍数。完整程序2C语言模板程序第#页共28页#includevst
4、dio.hintmain()intm,n,i;scanf(%d,%d,&m,&n);for(i=(mn?m:n);i+)if(i%m=0&i%n=O)printf(leasecommonmultipleis%d,i);break;return0;封装函数intlcm(intm,intn)inti;for(i=(mn?m:n);i+)if(i%m=0&i%n=O)returni;调用函数#includevstdio.hintmain()intm,n,i;intlcm(intm,intn);scanf(%d,%d,&m,&n);printf(leasecommonmultipleis%d,lcm(
5、m,n);return0;判断素数思路：从2开始到所求整数的开方依次求余，如果有能整除所求整数的整数，则所求整数为合数，反之为素数。完整程序3C语言模板程序第#页共28页#includevstdio.h#includevmath.hintmain()intnum;inti,k,flag=l;scanf(%d,&num);k=sqrt(num);for(i=2;iv=k;i+)if(num%i=O)printf(%disntaprimenumber!,num);flag=0;if(flag)printf(%disaprimenumber!,num);return0;封装函数intsushu(in
6、tnum)inti,k;k=sqrt(num);for(i=2;i#includeintmain()intnum;intsushu(intnum);scanf(%d,&num);if(sushu(num)=O)printf(%disntaprimenumber!,num);elseprintf(%disaprimenumber!,num);return0;冒泡排F序（升序）思路：N个数，每次比较相邻的两个数，如果前面的数大就相互交换，这样小的数就会像气泡样往前冒。趟排序完成后最后个数最大。共进行N-1趟排序。完整程序4C语言模板程序第#页共28页#includevstdio.h#defineN
7、10intmain()intnumN;inti,j；intt;for(i=0;ivN;i+)scanf(%d,&numi);for(i=0;ivN-l;i+)for(j=0;jvN-l-i;j+)if(numjnumj+1)t=numj;numj=numj+1;numj+1=t;for(i=0;inumj+1)t=numj;numj=numj+1;numj+1=t;调用函数#includevstdio.h#defineN10intmain()intnumN;inti,j;intt;voidmaopao(intnumN);for(i=0;iN;i+)scanf(%d,&numi);maopao(
8、num);for(i=0;i#defineN10intmain()intnumN;inti,j,k;intt;for(i=0;ivN;i+)scanf(%d,&numi);for(i=0;ivN-1;i+)k=i;for(j=i+1;jnumj)k=j;if(k!=i)t=numk;numk=numi;numi=t;for(i=0;iN;i+)printf(%d,numi);return0;封装函数voidxuanze(intnumN)inti,j,k;intt;for(i=0;ivN-1;i+)k=i;for(j=i+1;jnumj)k=j;if(k!=i)t=numk;numk=numi;
9、numi=t;调用函数#includevstdio.h#defineN10intmain()intnumN;inti,j,k;intt;voidxuanze(intnumN);for(i=0;ivN;i+)scanf(%d,&numi);xuanze(num);for(i=0;i#defineN10intmain()intaN,low=0,high=N-l,mid,i,key,flag=0;for(i=0;ikey)high=mid-1;elselow=mid+1;if(!flag)printf(Notfound!);return0;6封装函数intzheban(intaN,key)intlo
10、w=0,high=N-l,mid;while(lowv=high)mid=(low+high)/2;if(amid=key)printf(Found!Theindexif%d,mid);returnmid;elseif(amidkey)high=mid-1;elselow=mid+1;printf(Notfound!);return-1;调用函数#includevstdio.h#defineN10intmain()intaN,low=0,high=N-1,mid,i,key,flag=0;intzheban(intaN,key)；for(i=0;iintmain()intx,y,z;scanf(%d,%d,&x,&y);z=xy?x:y;printf(%d,z);return0;7封装函数intmax(intx,inty)intz;z=xy?x:y;returnz;调用函数#includevstdio.hintmain()intx,y,z;intmax(intx,inty);scanf(%d,%d,&x,&y);printf(%d,max(x,y);return0;(2)数组中找最大一维数组思路：让一个变量等于数组中第
