【文章內(nèi)容簡介】 int nright = (nWidth a)/2。if(b=nleftamp。amp。bchOut =39。*39。printf(%c,chOut)。printf()。r1void main()int i=1,j=1。for(i=1。ifor(j=1。jprintf(%d*%d=%d,i,j,i*j)。printf()1include void main()char c。//count1是正數(shù)的個數(shù)//count2是負數(shù)的個數(shù)int count1=0,count2=0。//sum1是正數(shù)之和//sum2是負數(shù)之和int sum1=0,sum2=0。int flage = 0。c=getchar()。while(c != 39。*39。)if(c == 39。39。)flage = 1。if(flage == 0)sum1 =(c48)。count1 。elseif(c != 39。39。)sum2=(c48)。flage=0。count2 。c = getchar()。printf(%d,%d,count1,count2)。printf(%f,%f,sum1/count1,sum2/count2)。1void main()int i,j。int s = 0。for(i = 100 。 i s = 0。for(j=1。 j if( i%j == 0 ) s = s j。if(s == i)printf(],i)。1include include void main()int n。long k = 1。float e = 1。n = 1。clrscr()。while ( fabs() = )n 。e = e 。k = k * n。printf(%f,e)。1include main()float x0,x1,x2,f0,f1,f2。x1=10。f1=2*x1*x1*x14*x1*x1 3*x1。x2=10。f2=2*x2*x2*x24*x2*x2 3*x2。do x0=(x1 x2)/2。f0=2*x0*x0*x04*x0*x0 3*x0。if((f0*f1)x2=x0。 f2=f0。elsex1=x0。 f1=f0。while(fabs(f0)1e6)。printf(______2*x*x*x4*x*x 3*x=0______:n)。printf(the root is %f,x0)。第六章includeint divisor(int a,int b) int r。while((r=a%b)!=0) a=b。b=r。return b。int multiple(int a,int b) int d。d=divisor(a,b)。return a*b/d。void main() int a,b,c,d。printf(intput (a,b): )。scanf(%d,%d,amp。a,amp。b)。c=divisor(a,b)。d=multiple(a,b)。printf(=%d=%d,c,d)。includevoid tongji(char a[]) int b[3]=0,0,0,i=0。while(a[i]!=39。39。) if((a[i]=65)||(a[i]=97))b[0] 。else if(a[i]=48)b[1] 。elseb[2] 。i 。printf(zimu have: %d。 shuzi have: %d。 qita have: %d,b[0],b[1],b[2])。getch()。void main() char a[100]。printf(Please input a string: )。gets(a)。tongji(a)。includeint flower(int n) int x=0,i,j,k。i=(n_)。j= (n/10_)。k=(n/100)。x=i*i*i j*j*j k*k*k。if(x==n) return 1。else return 0。void main() int i,n。printf(Please intput n: )。scanf(%d,amp。n)。if(n999||nelse for(i=100。iif(flower(i))printf(%d ,i)。getch()。includedefine SWAP(a,b) t=b。b=a。a=t。main() float x,y,t。printf(Enter two number (x,y): )。scanf(%f,%f,amp。x,amp。y)。SWAP(x,y)。printf(:x=%f,y=%f,x,y)。getch()。includeint fib(int n) int p。if(n==0) p=0。else if(n==1) p=1。else p=fib(n1) fib(n2)。return p。void main() int n。printf(Please input fib: )。scanf(%d,amp。n)。printf(=%d,fib(n))。includelong fac(int n) long f。if(n==0) f=1。else f=n*fac(n1)。return f。void main() int m,n。long f。printf(Please input (m,n): )。scanf(%ld,%ld,amp。m,amp。n)。f=fac(n m) fac(n)。printf(=%ld,f)。includevoid list() int i,j。for(i=1。i for(j=1。jprintf(%d*%d=%d ,i,j,i*j)。printf()。void main() list()。includeint he(int n) int i,s=0。for(i=1。iif(n%i==0)s =i。return s。void main() int i,j。for(i=1。ifor(j=1。jif((he(i)==j)amp。amp。(he(j)==i)amp。amp。(i!=j))printf(%d%d ,i,j)。includedefine max 100struct work long sid。char name[15]。worker[max]。