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

printf(\scanf(\dectobin(n); printf(\return 0;

}

#include //10-7 int f(int n){ if(n==0) }

return 0; return 1; if(n==1)

return f(n-1)+f(n-2);

int main(){ int n; }

printf(\scanf(\

printf(\return 0;

#include //10-8 void inverse(int n){ if(n<10){ printf(\ }

}

return;

printf(\inverse(n/10);

int main(){ int number; }

#include //10-9 int main(){

double fun(int n,double x);/*定义在调用之后，需声明*/ int n;

double x,root;

printf(\scanf(\

printf(\scanf(\inverse(number); return 0;

printf(\

scanf(\root=fun(n,x);

printf(\return 0;

}

double fun(int n,double x){ }

if(n==1)/*指数为，应返回x*/ return x; else

return x*fun(n-1,x);

实验11

#include//11-1-2 int main(){ char*

months[12]={\September\ }

int month;

printf(\scanf(\

printf(\return 0;

#include//11-1-3 #include int main(){

char

*weekdays[7]={\rday\ int i; }

gets(s);

for(i=0;i<7;i++)

if(strcmp(weekdays[i],s)==0) break; if(i<7)

printf(\else

printf(\return 0;

#include//11-1-4 #include #include

int max_len(char *s[],int n){ int maxLen=0,i; }

int main(){

char* s[10]; int n,i;

printf(\scanf(\

for(i=0;i

printf(\for(i=0;imaxLen) }

maxLen=strlen(s[i]);

return maxLen;

return 0; }

#include//11-1-5

char * str_cat(char *s, char *t){

char *p=s,*q=t; while(*p) p++; while(*q){ *p=*q; }

p++;q++;

*p='\\0'; return s;

}

int main(){

char s[80],t[80]; gets(s); gets(t);

puts(str_cat(s,t)); return 0;

}

#include//11-1-6 #include

#include

char *sub_str(char *s, char a, char b){ int n=strlen(s),i,j; char *t=(char*)malloc(n*sizeof(char));/*为t分配空间*/ for(i=0;s[i]!=a;i++);/*找到a在s中的位置*/ }

int main(){

char s[80],a,b; scanf(\getchar(); scanf(\getchar();

scanf(\

printf(\return 0;

for(j=0;s[j]!=b;j++);/*找到b在s中的位置*/

strcpy(t,&s[i]);/*将s中从s[i]开始的部分拷贝到t*/

t[j-i+1]='\\0';/*将t中从值为b的元素后面的部分从串中去掉*/ return t;

}

#include//11-1-7 char *change(char s[][20]){ char t[10]; int i; for(i=0;i<4;i++){

t[2*i]=s[i][8]; t[2*i+1]=s[i][9];

}

t[2*i]='\\0'; return t;

}

int main(){ }

char s[4][20],*p; int i;

for(i=0;i<4;i++) scanf(\p=change(s); printf(\return 0;

#include//11-1-8

float matrix(float a[][3],int n){ int i,j;

}

float sum=0.0;

for(i=0;i<3;i++) for(j=0;j<3;j++){ if(i==j) sum=sum+*(*(a+i)+j);

if(j==2-i&&i!=j) sum=sum+*(*(a+i)+j);

}

return sum;

int main(){

int i,j;

float a[3][3];

printf(\输入×数组\\n\for(i=0;i<3;i++) for(j=0;j<3;j++)

scanf(\printf(\return 0;

}

#include//11-2-1 #include #include struct stud_node{ int num;

char name[20]; int score;

struct stud_node* next; };

int main(){

struct stud_node *head, *tail, *p; int num,score;

char name[20];

int size=sizeof(struct stud_node); head=tail=NULL;

printf(\scanf(\

while(num!=0){ p=(struct stud_node*)malloc(size);

scanf(\p->num=num;

strcpy(p->name,name); p->score=score; p->next=NULL;