poj2562
来源：互联网 发布：淘宝网正品手提包女 编辑：程序博客网 时间：2024/06/06 01:00
#include
using namespace std;
int main(){
long a,b;
while(cin>>a>>b&&(a||b)){
intc[15]={0},d[15]={0},e[15]={0},num=0,max=0,lenc=0,lend=0,i;
while(a){
c[lenc++]=a;
a/=10;
}
while(b){
d[lend++]=b;
b/=10;
}
max=lenc>=lend? lenc:lend;
for(i=0;i
e[i]+=c[i]+d[i];
if(e[i]>=10){
e[i+1]+=e[i]/10;
e[i]%=10;
num++;
}
}
if(!num) cout<<"No carry operation."<<endl;
else if(num==1)cout<<num<<" carryoperation."<<endl;
else if(num>1) cout<<num<<" carryoperations."<<endl;
}
return 0;
}
0 0
