# Primary Arithmetic

745人阅读 评论(1)

Children are taught to add multi-digit numbers from right-to-left one digit at a time. Many find the "carry" operation - in which a 1 is carried from one digit position to be added to the next - to be a significant challenge. Your job is to count the number of carry operations for each of a set of addition problems so that educators may assess their difficulty.

Each line of input contains two unsigned integers less than 10 digits. The last line of input contains 0 0.

For each line of input except the last you should compute and print the number of carry operations that would result from adding the two numbers, in the format shown below.

123 456
555 555
123 594
0 0

NO carry operation.
3 carry operations.
1 carry operation.

#include<iostream>
using namespace std;

int main()
{
int n,m,c,t;
while(cin>>n>>m&&n&&m)
{
c=t=0;
if(n<m){ n=n+m;m=n-m;n=n-m; }
while(m>0)
{
if(m%10 + n%10 + c >9 ){ c=1; ++t;}
else c=0;
m/=10;
n/=10;
}
while(n>0)
{
if(n%10 + c > 9){c=1;++t;}
else c=0;
n/=10;
}
if(!t)cout<<"NO carry operation."<<endl;
else if(t==1)cout<<t<<" carry operation."<<endl;
else cout<<t<<" carry operations."<<endl;
}
return 0;
}
/**************************************************************
Problem: 1143
User: 3011216016
Language: C++
Result: Accepted
Time:0 ms
Memory:1520 kb
****************************************************************/
0
0

【直播】机器学习&数据挖掘7周实训--韦玮
【套餐】系统集成项目管理工程师顺利通关--徐朋
【直播】3小时掌握Docker最佳实战-徐西宁
【套餐】机器学习系列套餐（算法+实战）--唐宇迪
【直播】计算机视觉原理及实战--屈教授
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之矩阵--黄博士
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之凸优化--马博士
【套餐】Javascript 设计模式实战--曾亮

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：155831次
• 积分：3328
• 等级：
• 排名：第10092名
• 原创：177篇
• 转载：24篇
• 译文：2篇
• 评论：19条
阅读排行
评论排行
最新评论