C语言程序实例100个3.docx

1、C语言程序实例100个3C1003.txt C1002007-03-20 20:3968nmmm1.2.main()int number20,n,m,i;printf(the total numbers is:);scanf(%d,&n);printf(back m:);scanf(%d,&m);for(i=0;in-1;i+)scanf(%d,&numberi);scanf(%d,&numbern-1);move(number,n,m);for(i=0;iarray;p-)*p=*(p-1);*array=array_end;m-;if(m0) move(array,n,m);=69n133

2、1. 2.#define nmax 50main()int i,k,m,n,numnmax,*p;printf(please input the total of numbers:);scanf(%d,&n);p=num;for(i=0;in;i+)*(p+i)=i+1;i=0;k=0;m=0;while(mn-1)if(*(p+i)!=0) k+;if(k=3) *(p+i)=0;k=0;m+;i+;if(i=n) i=0;while(*p=0) p+;printf(%d is leftn,*p);=70main1.2.main()int len;char *str20;printf(ple

3、ase input a string:n);scanf(%s,str);len=length(str);printf(the string has %d characters.,len);length(p)char *p;int n;n=0;while(*p!=0)n+;p+;return n;71input()output()51.2.#define N 5struct student char num6;char name8;int score4; stuN;input(stu)struct student stu; int i,j;for(i=0;iN;i+) printf(n plea

4、se input %d of %dn,i+1,N);printf(num: );scanf(%s,stui.num);printf(name: );scanf(%s,stui.name);for(j=0;j3;j+) printf(score %d.,j+1);scanf(%d,&stui.scorej);printf(n);print(stu)struct student stu; int i,j;printf(nNo. Name Sco1 Sco2 Sco3n);for(i=0;iN;i+) printf(%-6s%-10s,stui.num,stui.name);for(j=0;jn);

5、for(i=0;idata=num;ptr-next=(link)malloc(sizeof(node);if(i=4) ptr-next=NULL;else ptr=ptr-next;ptr=head;while(ptr!=NULL) printf(The value is =%dn,ptr-data);ptr=ptr-next;=731.2./*reverse output a list*/ i nclude stdlib.hi nclude stdio.hstruct list int data;struct list *next;typedef struct list node;typ

6、edef node *link;void main() link ptr,head,tail;int num,i;tail=(link)malloc(sizeof(node);tail-next=NULL;ptr=tail;printf(nplease input 5 data=n);for(i=0;idata=num;head=(link)malloc(sizeof(node);head-next=ptr;ptr=head;ptr=ptr-next;while(ptr!=NULL) printf(The value is =%dn,ptr-data);ptr=ptr-next;= 741.2

7、.i nclude stdlib.hi nclude stdio.hstruct list int data;struct list *next;typedef struct list node;typedef node *link;link delete_node(link pointer,link tmp)if (tmp=NULL) /*delete first node*/ return pointer-next;else if(tmp-next-next=NULL)/*delete last node*/ tmp-next=NULL;else /*delete the other no

8、de*/ tmp-next=tmp-next-next;return pointer;void selection_sort(link pointer,int num) link tmp,btmp;int i,min;for(i=0;idata;btmp=NULL;while(tmp-next) if(mintmp-next-data)min=tmp-next-data;btmp=tmp;tmp=tmp-next;printf(40: %dn,min);pointer=delete_node(pointer,btmp);link create_list(int array,int num) l

9、ink tmp1,tmp2,pointer;int i;pointer=(link)malloc(sizeof(node);pointer-data=array0;tmp1=pointer;for(i=1;inext=NULL;tmp2-data=arrayi;tmp1-next=tmp2;tmp1=tmp1-next;return pointer;link concatenate(link pointer1,link pointer2) link tmp;tmp=pointer1;while(tmp-next)tmp=tmp-next;tmp-next=pointer2;return poi

10、nter1;void main(void) int arr1=3,12,8,9,11;link ptr;ptr=create_list(arr1,5);selection_sort(ptr,5); 751.2.main()int i,n;for(i=1;i1)break;if(n%2=0)printf(Even=);sum=dcall(peven,n);elseprintf(Odd=);sum=dcall(podd,n);printf(%f,sum);float peven(int n)float s;int i;s=1;for(i=2;i=n;i+=2)s+=1/(float)i;retur

11、n(s);float podd(n)int n;float s;int i;s=0;for(i=1;i=n;i+=2)s+=1/(float)i;return(s);float dcall(fp,n)float (*fp)();int n;float s;s=(*fp)(n);return(s);=771.2.main() char *s=man,woman,girl,boy,sister;char *q;int k;for(k=0;k5;k+);/*/ printf(%sn,*q);=781.2.#define N 4i nclude stdio.hstatic struct man cha

12、r name20;int age; personN=li,18,wang,19,zhang,20,sun,22;main()struct man *q,*p;int i,m=0;p=person;for (i=0;iN;i+)if(mage)q=p+;m=q-age;printf(%s,%d,(*q).name,(*q).age);=791.2.main()char *str120,*str220,*str320;char swap();printf(please input three stringsn);scanf(%s,str1);scanf(%s,str2);scanf(%s,str3);if(strcmp(str1,str2)0) swap(str1,str2);if(strcmp(str1,str3)0) swap(str1,str3);if(strcmp(str2,str3)0) swap(str2,str3);printf(after being sortedn);printf(%sn%sn%sn,str1,str2,str3);char swap(p1,p2)char *p1,*p2;char *p20;strcpy(p,p1);strcpy(p1,p2);strcpy(p2,p);