HDU 1000 1001 1002 1003 1004 1005（AC代码）

来源：互联网发布：getscript 获得js源码编辑：程序博客网时间：2024/05/22 18:24

1000

#include <stdio.h>int main(){    int a,b;    while(~scanf("%d%d",&a,&b))        printf("%d\n",a+b);    return 0;}

1001

#include <stdio.h>int main(){    int n;    while(~scanf("%d",&n))        printf("%d\n\n",n%2?(n+1)/2*n:n/2*(n+1));    return 0;}

1002

#include<stdio.h>#include<string.h>int main(){    char a[1002],b[1002];    int c,i,j,n,m,a1[1002],b1[1002],len1,len2,p;    scanf("%d",&n);    p=1;    m=n;    while(m--){        memset(a1,0,sizeof(a1));        memset(b1,0,sizeof(b1));        scanf("%s",a);        scanf("%s",b);        len1=strlen(a);        len2=strlen(b);        c=0;        for(i=len1-1;i>=0;i--)            a1[c++]=a[i]-'0';        c=0;        for(i=len2-1;i>=0;i--)            b1[c++]=b[i]-'0';        for(i=0;i<1002;i++){            a1[i]+=b1[i];            if(a1[i]>=10){                a1[i]-=10;                a1[i+1]++;            }        }        printf("Case %d:\n",p++);        printf("%s + %s = ",a,b);        for(i=1001;i>=0;i--){            if(a1[i])                break;        }        for(j=i;j>=0;j--)            printf("%d",a1[j]);        printf("\n");        if(p!=n+1)            printf("\n");    }    return 0;}

1003

#include <stdio.h>#define inf 0x8000int main(){    int t,n,max,i,j,f,l,r,k,sum;    scanf("%d",&t);    for(i=1;i<=t;i++){        scanf("%d",&n);        max=-inf;sum=0;k=1;        for(j=1;j<=n;j++){            scanf("%d",&f);            sum+=f;            if(sum>max){                max=sum;                l=k;                r=j;            }            if(sum<0){                k=j+1;                sum=0;            }        }        printf("Case %d:\n%d %d %d\n",i,max,l,r);        if(i-t)            printf("\n");    }    return 0;}

1004

#include<stdio.h>#include<string.h>int main(){    int n,i,j,sum,max,flag;    char a[1009][99];    while(~scanf("%d",&n),n){        max=flag=0;        for(i=0;i<n;i++)            scanf("%s",a[i]);        for(i=0;i<n;i++){            sum=0;            for(j=i+1;j<n;j++){                if(strcmp(a[i],a[j])==0)                    sum++;               }            if(max<sum){                max=sum;                flag=i;            }        }        puts(a[flag]);    }     return 0;}

1005

#include<stdio.h>int main(){    long a,b,n,i,f[100];    while(scanf("%ld%ld%ld",&a,&b,&n),(a+b)){        f[1]=f[2]=1;        for(i=3;i<=48;i++)            f[i]=(a*f[i-1]+b*f[i-2])%7;        printf("%ld\n",f[(n>48)?n%48:n]);    }    return 0;}

0 0