zoj 1874 Primary Arithmetic

#include "stdio.h"
#include "iostream"
#include "string.h"
using namespace std;

int main()
{
	char input1[20], input2[20];//对输入的字符的保存
	int num1[20], num2[20];//由字符转换为数字的保存
	int len1, len2, i, len, carry, temp, c;
	while (scanf("%s%s", input1, input2))
	{
		carry = c = 0;
		memset(num1, 0, sizeof(num1));
		memset(num2, 0, sizeof(num2));
		if (strcmp(input1, "0") == 0 && strcmp(input2, "0") == 0) break;
		len1 = strlen(input1), len2 = strlen(input2);

		for (i = 0; i < len1; i++)
			num1[len1-1-i] = input1[i] - 48;
		for (i = 0; i < len2; i++)
			num2[len2-i-1] = input2[i] - 48;
		len = len1 > len2 ? len1 : len2;

		for (i = 0; i < len; i++)
		{
			temp = num1[i] + num2[i] + c;
			if (temp >= 10)
			{
				carry++;
				c = temp / 10;
			}
		}
		if (carry == 1)
			printf("%d carry operation.\n", carry);
		else if (carry >1)
			printf("%d carry operations.\n", carry);
		else if (carry == 0)
			printf("No carry operation.\n");
	}
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值