河南省第四届ACM程序设计大赛部分答案.doc

T1#include#include#includeint Pow(int n,int x)int i,sum=1;for(i=1;i=x;i+)sum*=n;return sum;int main() char *p,c;int i,j,k,sum,n,l,*q;scanf(%d,&n);p=(char*)malloc(n*sizeof(char*);for(i=0;in;i+)*(p+i)=(char*)malloc(Pow(10,4)*sizeof(char);scanf(%s,*(p+i);for(i=0;i=A&*(*(p+i)=Z)for(j=0;jl;j+)sum+=(*(*(p+i)+j)-A+1)*Pow(26,l-1-j);printf(%dn,sum);elsesum=0;j=0;while(*(*(p+i)+j)!=0)sum+=(*(*(p+i)+j)-0)*Pow(10,l-1-j);j+;q=(int*)malloc(l*sizeof(int);j=0;while(sum!=0)qj=sum%26;sum=sum/26;if(qj=0)qj=26;sum-;j+;for(k=0;kj;k+)printf(%c,(qj-1-k-1+A);putchar(n);free(p);system(psuse);return 0;T2#include#includeint N,*P;int main()long digui(int now,long sum,int time);int i,v;long Wmin;scanf(%d,&N);scanf(%d,&v);P=(int *)malloc(N*sizeof(int *);for(i=0;i=0;i-)if(Pi2=1)time1=time+Pnow0-Pi0;sum1=sum+time1*Pi1;w1=digui(i,sum1,time1);break;for(i=now+1;iN;i+)if(Pi2=1)time2=time+Pi0-Pnow0;sum2=sum+time2*Pi1;w2=digui(i,sum2,time2);break;Pnow2=1;if(w1=0&w2=0)return sum;elseif(w1!=0&w2!=0)return w1w2 ? w1 : w2;else if(w1!=0)return w1;elsereturn w2;T3#include#include#includeint i,j;char *p;int Pow(int x,int y)int k,sum=1;for(k=0;ky;k+)sum*=x;return sum;int main()int N,sum;int digui();scanf(%d,&N);p=(char*)malloc(N*sizeof(char*);for(i=0;iN;i+)*(p+i)=(char*)malloc(300*sizeof(char);scanf(%s,*(p+i);for(i=0;iN;i+)j=0;sum=digui();printf(%dn,sum);return 0;int digui()int k=0,l,sum=0,num1,num2;char *s,c;c=*(*(p+i)+j+);if(0=c&c=9)s=(char*)malloc(4*sizeof(char);s0=c;k=1;while(0=(c=*(*(p+i)+j+)&c=9)sk=c;k+;j-;l=k;for(k=0;kl;k+)sum+=(sk-0)*Pow(10,l-1-k);return sum;elses=(char*)malloc(3*sizeof(char);s0=c;s1=*(*(p+i)+j+);s2=*(*(p+i)+j+);j+;num1=digui();j+;num2=digui();j+;if(s0=a)return num1+num2;elseif(s2=n)return num1num2 ? num1 : num2;#include#include#includeint Pow(int x,int y)int i,sum=1;for(i=0;iy;i+)sum*=x;return sum;int main()int i,n,j,m,k,l,N,sum,z1100,num;char *p,z21003,s4,c;scanf(%d,&N);p=(char*)malloc(N*sizeof(char*);for(i=0;iN;i+)*(p+i)=(char*)malloc(300*sizeof(char);scanf(%s,*(p+i);for(i=0;iN;i+)j=k=l=0;doc=*(*(p+i)+j+);if(0=c&c=9)s0=c;m=1;while(0=(c=*(*(p+i)+j+)&c=9)sm=c;m+;j-;n=m;for(num=0,m=0;mn;m+)num+=(sm-0)*Pow(10,n-1-m);z1k=num;k+;while(z2l-10=,)k-;if(z2l-20=a)z1k-1=z1k-1+z1k;elseif(z2l-22=n)z1k-1=z1k-1z1k ? z1k-1 : z1k;l=l-2;if(l=0)sum=z10;elseif(c=,)z2l0=c;l+;elseif(c!=)z2l0=c;z2l1=*(*(p+i)+j+);z2l2=*(*(p+i)+j+);j+;l+;while(l!=0);printf(%dn,sum);return 0;T4#include#includeint N,*a,*b;int main()int i,j,max,min,cha;int digui(int r,int c,int max,int min);scanf(%d,&N);a=(int *)malloc(N*sizeof(int *);b=(int *)malloc(N*sizeof(int *);for(i=0;iN;i+)*(a+i)=(int *)malloc(N*sizeof(int);*(b+i)=(int *)malloc(N*sizeof(int);for(i=0;iN;i+)for(j=0;jmax)max=arc;elseif(arc=0&br-1c=0)cha0=digui(r-1,c,max,min);if(r+1=0&brc-1=0)cha2=digui(r,c-1,max,min);if(c+1N&brc+1=0)cha3=digui(r,c+1,max,min);for(k=0;kchak)ch=chak;brc=0;return ch;T6SUBSTRING#include#include#includeint main()int n,i,j,k,l,m,max;char *p,*f;scanf(%d,&n);p=(char*)malloc(n*sizeof(char*);f=(char*)malloc(100*sizeof(char);for(i=0;in;i+)*(p+i)=(char*)malloc(100*sizeof(char);scanf(%s,*(p+i);for(i=0;in;i+) max=0;l=strlen(*(p+i);for(j=0;jl;j+)for(k=1;k+j+1=0;k+)if(*(*(p+i)+j-k)!=(*(*(p+i)+j+k)break;if(2*k-1max)m=j-k+1;max=2*k-1;for(k=0;k+j-1=0;k+)if(*(*(p+i)+j-k)!=(*(*(p+i)+j+1+k)break;if(2*kmax) m=j-k+1;max=2*k;for(j=0;jmax;j+)*(f+j)=*(*(p+i)+m+j);*(f+j)=0;printf(%sn,f);system(pause);return 0;T7BOBSLEDDING#include#includeint main()int g,n,i,j,*p,v=1,max=1;scanf(%d%d,&g,&n);p=(int*)malloc(g+1)*sizeof(int*);for(i=0;i=g;i+)*(p+i)