（挑战编程_5_1）Primary Arithmetic

http://www.programming-challenges.com/pg.php?page=downloadproblem&probid=110501&format=html

#include <iostream>
#include <cstdlib>
#include <vector>
#include <set>
#include <string>
#include <fstream>
#include <cassert>

using namespace std;

//#define _MY_DEBUG_

/*
	MainStructure: 主结构
*/
void MainStructure();

/*
	Process：处理每一组数据
*/
void Process();

/*
	传入两个非负整数，计算进位的数目
*/
int CarryCount(unsigned int num1, unsigned int num2);

int main()
{
	MainStructure();
	return 0;
}

void MainStructure()
{
	
#ifdef _MY_DEBUG_
	string inputStr = "C:/Users/cao/Desktop/算法/要看的书/算法/2挑战编程/input/1.inp";
	//string inputStr = "D:/2挑战编程/input/110205.inp";
	string outputStr = "C:/Users/cao/Desktop/算法/要看的书/算法/2挑战编程/input/0000001.outp";
	ifstream fin;
	fin.open(inputStr);	
	

	cin.rdbuf(fin.rdbuf());	

	//ofstream fout;
	//fout.open(outputStr.c_str());

	//cout.rdbuf(fout.rdbuf());
#endif

	Process();
		
}

void Process()
{
	unsigned int num1 = 0;
	unsigned int num2 = 0;
	while ((cin >> num1 >> num2) && !(num1 == 0 && num2 == 0))
	{
		/*if (num1 == 0 && num2 == 0)
		{
			break;
		}*/
		int count = CarryCount(num1, num2);
		if (count == 0)
		{
			cout << "No carry operation." << endl;
		}
		else if (count > 1)
		{
			cout << count << " carry operations." << endl;
		}
		else
		{
			cout << count << " carry operation." << endl;
		}

	}

}

int CarryCount(unsigned int num1, unsigned int num2)
{
	// 进位次数
	int count = 0;
	// 进位
	int carry = 0;
	while (num1 > 0 || num2 > 0)
	{
		int a = num1 % 10;
		num1 /= 10;
		int b = num2 % 10;
		num2 /= 10;
		int c = a + b + carry;
		if (c > 9)
		{
			++count;
		}
		carry = c / 10;
	}
	return count;
}