C语言程序设计实验指导 部分源代码(5)

x=m;

s+=x*x*x; m/=10; }while(m); if(s==n) return 1; return 0;

}

int main(){ }

int m,n,i;

printf(\scanf(\printf(\scanf(\for(i=m;i<=n;i++) if(is(i))

printf(\return 0;

#include//5-8 double fact(int n);

int main(void){ int i; double sum=0.0;/*需要初始化为*/ for(i=1;i<=10;i++)/*上界是*/

sum=sum+fact(i);

printf(\

return 0; }

double fact(int n){ }

int i;

double result=1.0;

for(i=1;i<=n;i++) result=result*i;/*result中累积n!*/ return result;

实验7

#include

int main(){//7-2-4 int a[6][6],n,i,j,flag=1; printf(\

scanf(\

printf(\for(i=0;i

if(a[i][j]){ flag=0; } break;

break;

if(flag==0)

if(flag==0)

printf(\else printf(\return 0;

}

#include

int main(){//7-2-6 int a[6][6],n,i,j,row,col; printf(\ scanf(\

printf(\for(i=0;i

for(i=0;i

row=i;col=0;

for(j=0;j

if(a[i][j]>a[row][col]){ col=j;

}

for(j=0;j

if(a[j][col]

if(j>=n){//找到鞍点元素a[row][col]

printf(\break;

} }

if(i>=n)/*所有行都检测过没有找到鞍点*/

printf(\

return 0; }

#include int main(){//7-3-2

char c,s[80]; int i,index=-1;

printf(\c=getchar(); getchar();

printf(\gets(s);

i=0;

while(s[i]!='\\0'){

if(s[i]==c) index=i;

i++; }

if(index>-1)

printf(\else

printf(\ return 0; }

#include int main(){//7-3-3 char s[80];

int i,upcase=0,count=0; printf(\gets(s);

i=0;

while(s[i]!='\\0'){ }

if(s[i]>='A'&&s[i]<='Z'){ upcase++;

switch(s[i]){ case 'A': }

case 'E': case 'I': case 'O':

case 'U':count++;

} i++;

}

if(upcase)

count=upcase-count;

printf(\return 0;

#include int main(){//7-3-4

char s[80]; int i;

printf(\gets(s); i=0;

while(s[i]!='\\0'){ if(s[i]>='A'&&s[i]<='Z')

s[i]='Z'-(s[i]-'A'); i++;

}

printf(\return 0;

}

#include

int main(){//7-3-5 char s[80]; int i,n=0; printf(\

gets(s); i=0;

while(s[i]!='\\0'){ if(s[i]>='0'&&s[i]<='9'){ n=n*16+s[i]-'0';

i++;

continue;

}

switch(s[i]){

case 'a':

case 'A':n=n*16+10;break; case 'b':

case 'B':n=n*16+11;break; case 'c':

case 'C':n=n*16+12;break; case 'd':

case 'D':n=n*16+13;break; case 'e':

case 'E':n=n*16+14;break;

}

}

case 'f':

case 'F':n=n*16+15;break; } i++;

printf(\return 0;

实验8

#include//8-1-1 void move(int *, int, int); int main(){ int m, n, i, a[80], *p;

printf(\scanf(\

for(p=a,i=0;i

printf(\for(i=0;i

printf(\ return 0; }

void move(int *x,int n, int m){

int i,j,k;

for(i=0;i

k=x[n-1];/*暂存x[n-1]，因为它将被覆盖*/ for(j=n-1;j>0;j--) x[j]=x[j-1];/*设置断点*/ x[0]=k;

}

#include//8-1-2 #include

int search(int *, int, int); int main(){

int *a,n,i,x,index; printf(\

scanf(\

if((a=(int*)malloc(n*sizeof(int)))!=NULL) exit(1);

printf(\for(i=0;i