新113道C语言题目.docVIP

113道C语言题目,超经典的~~~ 1.输入两个正整数，m和n，求其最大公约数和最小公倍数。#includestdio.hvoid main(){?int hcf(int,int);????? /*函数声明*/?int lcd(int,int,int);? /*函数声明*/?int u,v,h,l;?printf(Please ｉｎｐｕｔ two numbers:\n);?scanf(%d,%d,u,v);?h=hcf(u,v);?printf(H.C.F=%d\n,h);?l=lcd(u,v,h);?printf(L.C.D=%d\n,l);}int hcf(int u,int v){?int t,r;?if(vu)?{t=u;u=v;v=t;}?while((r=u%v)!=0)?{u=v;v=r;}?return(v);}int lcd(int u,int v,int h){?return(u*v/h);} 91.编一个子函数GCD，求两个正整数的最大公约数，主程序输入n个自然数，调GCD，求出这n个数的最大公约数。#includestdio.hint GCD(int,int);void main(){?int a[100],i,n,k;?printf(请输入数组元素的个数:\n);?scanf(%d,n);?printf(请输入%d个正整数:\n,n);?for(i=0;in;i++)??scanf(%d,a[i]);??? k=GCD(a[0],a[1]);?for(i=2;in;i++)??k=GCD(k,a[i]);?printf(输入的%d个正整数的最大公约数是:%d\n,n,k);} int GCD(int x,int y){?int i,min,p,q,gcd;?if(x=y)??min=x;?else??min=y;?for(i=1;i=min;i++)?{??p=x%i;??q=y%i;??if(p==0q==0)???gcd=i;?}?return gcd;} 68.用for循环语句计算1到20的和，并将结果输出。#include stdio.hvoid main(){?int i=1,sum=0;?for (;i=20;)?{??sum=sum+i;??i++;?}?printf(1到20的和是%d\n,sum);} 3.输入一个正整数求出它是几位数；输出原数和位数。#includestdio.hint digit;void main(){?void count(char[]);?char text[80];?printf(Please ｉｎｐｕｔ numbers:\n);?gets(text);?printf(Numbers:\n);?puts(text);?digit=0;?count(text);?printf(digit:%d\n,digit);}void count(char str[]){?int i;?for(i=0;str[i]!=\0;i++)?? if(str[i]=0str[i]=9)???digit++;} 4.输入一个正整数，输出原数并逆序打印出各位数字。#includestdio.hvoid invertLongInt(long);void main(){?unsigned long iNumber;?printf(Please ｉｎｐｕｔ a number:\n);?scanf(%ld,iNumber);?printf(The ｉｎｐｕｔ number is:%ld\n,iNumber);?printf(The inverse number is:);?invertLongInt(iNumber);}void invertLongInt(long x){?if(x=0x=9)??printf(%d\n,x);?else?{??printf(%d,x%10);??invertLongInt(x/10);?}} 86.编一个函数实现将一个整型的一维数组中的数逆序存放，不使用辅助数组。主函数输入一个整型的一维数组，调用上述函数，将该数组逆置，将结果输出。#includestdio.h#define N 10void main(){?int a[N],i,temp;?printf(enter array a:\n);?for(i=0;iN;i++)??scanf(%d,a[i]);?printf(array a:\n);?for(i=0;iN;