55.進位

#include <stdio.h> // printf
int main()
{
	int x[10000], y[10000];
	int k = 0;
	do {
		scanf_s("%d%d", &x[k], &y[k]);
		k++;
	} while (!(x[k - 1] == 0 && y[k - 1] == 0));

	int sum[10000];
	for (int i = 0; i < k - 1; i++) {
		int add = 0;
		sum[i] = 0;
		while (x[i] != 0 || y[i] != 0) {
			if ((x[i] % 10) + (y[i] % 10) + add >= 10) {
				sum[i]++;
				x[i] /= 10;
				add = 1;
				y[i] /= 10;
			}
			else {
				x[i] /= 10;
				y[i] /= 10;
				add = 0;
			}
		}
		if (sum[i] == 1)
			printf("1 carry operation.\n");
		else if (sum[i] > 1)
			printf("%d carry operations.\n", sum[i]);
		else
			printf("No carry operation.\n");
	}
}