HDU3953(找规律，坑～)

#include <bits/stdc++.h>
using namespace std;

int main () {
    int t, kase = 0;
    cin >> t;
    char a[111], b[111];
    while (t--) {
        long long sum = 0;
        cin >>a >> b;
        for (int i = 0; i < strlen (a); i++)
            sum += a[i]-'0';
        for (int i = 0; i < strlen (b); i++)
            sum += b[i]-'0';
        cout << "Case " << ++kase << ": " << sum << endl;
    }
    return 0;
}