[编程题]Primary Arithmetic
- 热度指数：3134 时间限制：C/C++ 1秒，其他语言2秒 空间限制：C/C++ 64M，其他语言128M
- 算法知识视频讲解
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.
输出描述:
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.
示例1
输入
123 456 555 555 123 594 0 0
输出
NO carry operation. 3 carry operations. 1 carry operation.
#include <stdio.h>
#include <string.h>
//非常简单的代码，应该一目了然，就不解释了
int main() {
int a,b;
while (scanf("%d %d", &a, &
展开全文
#include <iostream>
using namespace std;
int main() {
int a, b;
while (cin >> a >> b) {
if (a == 0 && b == 0
展开全文
#include <iostream>
using namespace std;
int main() {
string x,y;
while(cin>>x>>y && x!="0" && y!
展开全文
实际上不用计算加法。 #include <stdio.h>
#include <string.h>
int main()
{
char a[10],b[10];
&nbs
展开全文
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
int add(vector<int>
展开全文
#include <iostream>
using namespace std;
int main() {
string x, y;
while (cin >> x >> y) {
if (x == "0"
展开全文
def fun(a):
res = []
while a >0:
t = a % 10
a = a / 10
res.append(t)
return res
def add(a, b):
a = fun(a)
展开全文
#include<stdio.h>
#include<string.h>
int main() {
int i, j, A[20], B[20];
char S1[20], S2[20];
scanf("%s %s", S1, S2);
fo
展开全文
#include <iostream>
using namespace std;
int main() {
unsigned long a, b;
while (cin >> a >> b) { // 注意 while 处理多个 case
展开全文
#include <bits/stdc++.h>
using namespace std;
int main() {
string a, b;
while (cin >> a >> b) { // 注意 while 处理多个 case
展开全文
问题信息
难度：
36条回答
14收藏
8035浏览
通过挑战的用户
查看代码-
2022-11-23 20:59:07 -
2022-09-06 16:20:14 -
2022-08-31 20:03:35
-
2022-08-29 20:15:15
-
2022-08-04 10:58:11
相关试题
-
扫描二维码，关注牛客网
- 意见反馈
-
下载牛客APP，随时随地刷题
扫一扫，把题目装进口袋
- 求职之前，先上牛客
-
扫描二维码，进入QQ群
扫描二维码，关注牛客公众号
- 公司地址：北京市朝阳区北苑路北美国际商务中心K1座一层-北京牛客科技有限公司
- 联系方式：010-60728802 投诉举报电话：010-57596212（朝阳人力社保局）
- 牛客科技© All rights reserved admin@nowcoder.com
- 京ICP备14055008号-4 增值电信业务经营许可证 营业执照 人力资源服务许可证
-
京公网安备
11010502036488号
