这是一道明显的水题,必须过的。
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <assert.h>
#include <algorithm>
#include <math.h>
#include <ctime>
#include <functional>
#include <string.h>
#include <stdio.h>
#include <numeric>
#include <float.h>
using namespace std;
int main() {
string s1, s2;
while (cin >> s1 >> s2) {
if (s1 == "0" && s2 == "0") break;
bool carrier = false;
int i1 = s1.size() - 1, i2 = s2.size() - 1;
int ans = 0;
while (i1 >= 0 || i2 >= 0) {
if (carrier) ans++;
int val1 = 0, val2 = 0;
if (i1 >= 0) val1 = s1[i1] - '0';
if (i2 >= 0) val2 = s2[i2] - '0';
int val = val1 + val2;
if (carrier) val++;
if (val > 9) carrier = true;
else carrier = false;
i1--; i2--;
}
if (carrier) ans++;
if (ans == 0) cout << "No carry operation." << endl;
else if (ans == 1) cout << "1 carry operation." << endl;
else cout << ans << " carry operations." << endl;
}
return 0;
}