POJ 2562:Primary Arithmetic
来源:互联网 发布:数据库架构师职责 编辑:程序博客网 时间:2024/06/03 17:38
Primary Arithmetic
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11135 Accepted: 4093
Description
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.
Input
Each line of input contains two unsigned integers less than 10 digits. The last line of input contains 0 0.
Output
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.
Sample Input
123 456555 555123 5940 0
Sample Output
No carry operation.3 carry operations.1 carry operation.
Source
Waterloo local 2000.09.23
你 离 开 了 , 我 的 世 界 里 只 剩 下 雨 。 。 。
#include <cstdio>int main(){ long int a, b; int carry, c; while (scanf("%ld%ld", &a, &b) , a + b) { carry = c = 0; while (a || b) { c = (a % 10 + b % 10 + c) > 9 ? 1 : 0; carry += c; a /= 10; b /= 10; } if (carry == 0)puts("No carry operation."); else if (carry == 1)puts("1 carry operation."); else printf("%d carry operations.\n", carry); } return 0;}
1 0
- POJ-2562:Primary Arithmetic
- poj 2562 Primary Arithmetic
- POJ 2562Primary Arithmetic
- poj 2562 Primary Arithmetic
- POJ 2562:Primary Arithmetic
- POJ-2562-Primary Arithmetic
- POJ Problem 2562 Primary Arithmetic
- POJ 2562 Primary Arithmetic G++
- POJ 2562 Primary Arithmetic(简单题)
- POJ 2562 Primary Arithmetic(高精度)
- POJ 2562 Primary Arithmetic 进位统计
- Primary Arithmetic
- Primary Arithmetic
- Primary Arithmetic
- Primary Arithmetic
- POJ 2562 Primary Arithmetic(我的水题之路——模拟加法进位)
- zoj 1874 || poj 1562 Primary Arithmetic(水题。)
- uva10035 Primary Arithmetic
- JAVA基础(一) 基本数据类型
- 贪心 2
- iOS 即时通讯xmpp 之Linux搭建ejabberd服务器
- swift-函数-2
- LoadRunner生成随机字符串使用
- POJ 2562:Primary Arithmetic
- Codeforces Round #341 (Div. 2)-C. Wet Shark and Flowers(区间概率)
- UrlRewrite伪静态设置以后真的html页面无法访问的问题
- 萨达是
- linux tcp高并发
- 机器学习笔记(二)数理统计
- 坚持的力量
- Codeforces Round #341 (Div. 2) A. Wet Shark and Odd and Even (水)
- Tomcat中如何配置首页面,虚拟目录。