hdu 1002
2014-03-23 14:19
295 查看
#include<stdio.h> #include<string.h> int Maxlen; char a[1010],b[1010]; int an1[1010],an2[1010]; /*大数相加程序*/ int Add(int Maxlen,int an1[],int an2[]) { int i; for(i=0;i<Maxlen;i++) { an1[i]+=an2[i]; if(an1[i]>=10) { an1[i]-=10; an1[i+1]++; } } } int main() { freopen("in.txt","r",stdin); int i,j; int n; int h,k=1; scanf("%d",&n); h=n; while(n--) { scanf("%s",a); scanf("%s",b); memset(an1,0,sizeof(an1)); memset(an2,0,sizeof(an2)); int len1=strlen(a); int len2=strlen(b); if(len1>len2) Maxlen=len1; Maxlen=len2; for(j=0,i=len1-1;i>=0;i--) an1[j++]=a[i]-'0'; for(j=0,i=len2-1;i>=0;i--) an2[j++]=b[i]-'0'; Add(Maxlen,an1,an2); for(i=1010;i>=0;i--) { if(an1[i]!=0) break; } printf("Case %d:\n",k); printf("%s + %s = ",a,b); //printf("%d\n\n",a,b,an1[i]); for(i=len1-1;i>=0;i--) { printf("%d",an1[i]); } if(k==h) printf("\n"); else printf("\n\n"); k++; } return 0; }
相关文章推荐
- HDU 1405
- HDU 1297
- hdu 1205
- hdu 2087
- hdu 1016
- HDU 1622 Trees On The Level
- HDU 1063 Exponentiation
- HDU 1166 敌兵布阵
- hdu 1202
- HDU 4332(状态压缩dp+矩阵连乘)
- HDU 3065(ac自动机)
- HDU 4714 Tree2cycle
- HDU 4709 Herding
- HDU 4717 The Moving Points
- HDU 4722 Good Numbers
- hdu 1007 Quoit Design
- hdu 1241 Oil Deposits
- 字符串匹配自动机
- HDU 3003
- HDU 3006