C语言模拟题参考答案.docx

C语言模拟题参考答案第一题#include#includevoid main()char s100;int m,k=0,n;gets(s);n=strlen(s); while(sn-1!=$)printf(请重新输入n);gets(s);n=strlen(s);int f(char s100,int k,int i,int j);while(sk!=&) k+;m=f(s,k,k-1,k+1);if(m=0)printf(yesn);elseprintf(non);int f(char s100,int k,int i,int j)int n;n=strlen(s);if(k=0)&(n=2)return(0);else if(si!=sj) return(1); else if(i=0)&(j=n-2) return(0); else f(s,k,i-1,j+1); 第二题#include#includevoid main()int n,m,s,t;int *p,*q,*r;int *create(int n,int m);void scan(int *p,int n,int m);void calculate(int *p1,int *p2,int *r,int n,int m,int s,int t); void print(int *r,int n,int t);char c= ;while(c!=)printf(请输入矩阵1的大小:n); printf(n=); scanf(%d,&n); printf(m=); scanf(%d,&m); printf(请输入矩阵2的大小:n); printf(s=);scanf(%d,&s); printf(t=); scanf(%d,&t); while(m!=s) printf(请重新输入n); printf(请输入矩阵1的大小:n); printf(n=); scanf(%d,&n); printf(m=); scanf(%d,&m); printf(请输入矩阵2的大小:n); printf(s=); scanf(%d,&s); printf(t=); scanf(%d,&t); p=create(n,m); q=create(s,t); r=create(n,t);printf(请输入矩阵1的元素:n); scan(p,n,m);printf(请输入矩阵2的元素:n); scan(q,s,t);printf(计算结果为:n); calculate(p,q,r,n,m,s,t); print(r,n,t);fflush(stdin);printf(按任意键继续，退出请按.n);scanf(%c,&c);int *create(int n,int m)int *p;int i,j;p=(int *)malloc(sizeof(int *)*n);for(i=0;i=n-1;i+)*(p+i)=(int *)malloc(sizeof(int)*m);for(j=0;j=m-1;j+)*(*(p+i)+j)=0;return(p);void scan(int *p,int n,int m)int i,j;for(i=0;i=n-1;i+)for(j=0;j=m-1;j+)scanf(%d,&pij);void calculate(int *p1,int *p2,int *r,int n,int m,int s,int t) int i,j,k; for(i=0;i=n-1;i+) for(j=0;j=t-1;j+) for(k=0;k=m-1;k+) rij=rij+p1ik*p2kj;void print(int *r,int n,int t)int i,j;for(i=0;i=n-1;i+)for(j=0;j=t-1;j+) printf(%d ,rij);printf(n);第三题#includevoid main()int m,n,a4,i,m1,m2,k,j,m0=0;char c= ;int f(int m0,int m,int m1,int m2);while(c!=)scanf(%d,&m); while(m9999)|(m1000) printf(请重新输入n); scanf(%d,&m);a0=m/1000;a1=m/100-m/1000*10;a2=(m%100-m%10)/10;a3=m%10; for(i=0;i=3;i+)for(j=i+1;jaj)k=ai; ai=aj;aj=k;m1=a0*1000+a1*100+a2*10+a3;m2=a3*1000+a2*100+a1*10+a0;n=f(m0,m,m1,m2);printf(结果是%d.n,n);fflush(stdin);printf(按任意键继续，退出请按:);c=getchar();int f(int m0,int m,int m1,int m2)int a4,i,j,k;if(m-m0=0)return(m);if(m-m0!=0)m0=m;m=m2-m1;a0=m/1000;a1=m/100-m/1000*10;a2=(m%100-m%10)/10;a3=m%10; for(i=0;i=3;i+)for(j=i+1;jaj)k=ai; ai=aj;aj=k;m1=a0*1000+a1*100+a2*10+a3;m2=a3*1000+a2*100+a1*10+a0;f(m0,m,m1,m2);第四题#include#includestruct chchar c;struct ch *next;void main()int n=0;struct ch *list;struct ch *scan(int &n);struct ch *change(struct ch*p);void print(struct ch*p);struct ch *f(struct ch*list,int n);int g(struct ch*list);printf(请输入链表：n);list=scan(n);list=change(list);printf(改变后的链表为:n);print(list);n=g(list);list=f(list,n);printf(最终的链表为:n);print(list);struct ch *scan(int &n)struct ch*head,*p1,*p2;void print(struct ch*p);head=NULL;p1=p2=(struct ch*)malloc(sizeof(struct ch);p1-next=NULL;scanf(%c,&p1-c);while(p1-c!=0)n+;if(n=1)head=p1;p2=p1;printf(此时的链表为:n);print(head);p1=(struct ch*)malloc(sizeof(struct ch);fflush(stdin);scanf(%c,&p1-c);p2-next=p1;p1-next=NULL;p2-next=NULL;return(head);void print(struct ch*p)struct ch*q=p;while(q!=NULL)printf(%cn,q-c);q=q-next;struct ch *change(struct ch*p)char cp100= ;int i,j=0;struct ch *q=p;struct ch *q1,*q2;while(q!=NULL) q1=p;while(q1-next!=q)&(q1-next!=NULL)q1=q1-next;q2=q;for(i=0;ic)q1-next=q2-next;q2-next=NULL;break;if(i=100)cpj=q-c; j+;q=q-next;elseq=q1-next;q=NULL;return(p);int g(struct ch*head)struct ch*p=head;int n=0;while(p!=NULL)n+;p=p-next;return(n);struct ch *f(struct ch*head,int n)struct ch*q1,*q2,*t1,*t2,*s;int i,j,t,r;q1=q2=head; for(i=1;i=n-1;i+)for(j=1;jnext;if(q1-cq2-c)if(j2) s=q1-next; q1-next=q2-next; q2-next=s; t2-next=q1; head=q2;if(j=2)q1-next=q2-next;q2-next=head;head=q2;q2=head;q1=head;q1=q2=head;for(i=1;i=n-1;i+)for(j=1;jnext;