| ||||||||||
Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
请教更简单的解法#include<iostream.h> #include<string.h> #include<memory.h> int main() { int n,i,k,j,p;char a[20],b[20]; cin>>n; while(n--) { memset(a,'0',sizeof(a));memset(b,'0',sizeof(b)); cin>>a>>b; if(strlen(a)>strlen(b)) {k=strlen(a);b[strlen(b)]='0';a[strlen(a)]='0';} else {k=strlen(b);a[strlen(a)]='0';b[strlen(b)]='0';} for(i=0;i<k;i++) { b[i]+=a[i]-'0'; j=i; while(b[j]>'9') { b[j]-=10; b[j+1]++;j++; }; } for(i=19;;i--) { if(b[i]!='0') break; } b[i+1]='\0'; k=strlen(b); p=0; for(j=0;j<=k;j++) { if(b[j]=='0'&&p==0) ; else { p=1;cout<<b[j];} } cout<<endl; }; return 0; } Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator