C语言编程重点1.doc

1,.求【m n】中既不能被7整除也不能被5整除的和#include stdio.h int fun(int m,int n) /*begin*/int i,sum=0;for(i=m;i=n;i+)if(i%7)!=0)&(i%5)!=0)sum=sum+i;return sum;/*end*/ void main() void NONO( );/函数声明 int s; int m,n; printf(Enter m n:n); scanf(%d %d,&m,&n); s=fun(m,n); printf(s=%dn,s); NONO( ); void NONO( ) FILE *fr,*fw; int i,x,y; fr=fopen(D:exam03910431PROGIN.DAT,r); fw=fopen(D:exam03910431PROGOUT.DAT,w); for(i=1;i=5;i+) fscanf(fr,%d,%d,&x,&y); fprintf(fw,The Result is :%d*n,fun(x,y); fclose(fr); fclose(fw); 2. 求3*3矩阵的最小值#include#defineN3intfun(intaNN)intmin;/*begin*/inti,j;min=a00;for(i=0;iN;i+)for(j=0;jN;j+)if(aijmin)min=aij;/*end*/returnmin;voidmain()voidNONO();/函数声明intaNN=-1,2,3,4,9,5,7,8,6;inti,j,min;printf(arrayis:n);for(i=0;iN;i+)for(j=0;jN;j+)printf(%5d,aij);printf(n);min=fun(a);printf(Resultis:%dn,min);NONO();voidNONO()FILE*fr,*fw;inti,j,k,m,aNN;fr=fopen(D:exam03910411PROGIN.DAT,r);fw=fopen(D:exam03910411PROGOUT.DAT,w);for(i=1;i=5;i+)for(j=0;jN;j+)for(k=0;kN;k+)fscanf(fr,%d,&ajk);fprintf(fw,%4d,ajk);fprintf(fw,Min=%dn,fun(a);fclose(fr);fclose(fw);3.Sum=1-.#include stdio.h double fun( int n ) double c; /*begin*/ c=0.0 ; int i,t=1; for(i=1;i=n;i+) c=c+t*1.0/(2*i-1);t=-t; return c;/*end*/ void main() void NONO( );/函数声明 double sum; int n; printf(Enter n:n); scanf(%d,&n); sum=fun(n); printf(sum=%.4fn,sum); NONO( ); void NONO( ) FILE *fr,*fw; int i, x; fr=fopen(D: exam03910304PROGIN.DAT,r); fw=fopen(D: exam03910304PROGOUT.DAT,w); for(i=1;i=5;i+) fscanf(fr,%d,&x); fprintf(fw,s=%.4fn,fun(x);fclose(fr); fclose(fw);4.将数组a的5个元素对折后再输出，比如：a5=1,2,3,4,5,对折后输出1,2,3,2,1 #define M 5 void main( ) int i,a100,t; /clrscr(); for(i=0;iM;i+) /*found*/ _(1)_ /答案：scanf(%d,&ai); /*found*/ for(i=0;_(2)_;i+) /答案：i2/M aM-i-1=ai; for(i=0;i=x) s =s+t; n=n+2.0; k=-k; t=k/n; return s ; /程序编写部分 /*end*/ void main() double x,sum; printf(Enter x:n); scanf(%lf,&x); sum=fun(x); printf(sum=%.4fn,sum); NONO( ); NONO( ) FILE *fr,*fw; int i; double x; fr=fopen(D:exam04500129PROGIN.DAT,r); fw=fopen(D:exam04500129PROGOUT.DAT,w); for(i=1;i=5;i+) fscanf(fr,%lf,&x); fprintf(fw,s=%.4fn,fun(x); fclose(fr); fclose(fw); 6. 输出fabonacii数列1,1,2,3,5,8,11，。前20项，每5个数换一行#include stdio.h void main() long int f20=1,1; int i; /clrscr(); /*found*/ _(1)_;/填：printf(%8ld%8ld,f0,f1); for(i=2;i20;i+) fi=fi-1+fi-2; /*found*/ if(_(2)_) printf(n);/填：i%5=0 printf(%8ld,fi); printf(n); 7.公倍数#includestdio.h#includemath.h#includeconio.h#includestdlib.hvoidmain()intm=76,n=40,t,i;/*begin*/i=m%n;t=m*n;while(i!=0)m=n;n=i;i=m%n;/辗转相除法t=t/n;/最小公倍数等于两数乘积/最大公约数/*end*/printf(%d%dn,n,t);NONO(