UESTC 1012 Ladygod （多校联盟3）

题目地址：http://acm.uestc.edu.cn/#/problem/show/1012

思路：4位相加最多只会产生5位数，进制越低，位数越长

AC代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <climits>
#include <cmath>
#include <cctype>
const int inf = 0x3f3f3f3f;//1061109567
typedef long long ll;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
using namespace std;
int a[5],b[5],c[5];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        memset(c,0,sizeof(c));
        int len1 = 0;
        int len2 = 0;
        int p = 0;
        while(x)
        {
            a[len1++] = x % 10;
            x /= 10;
            p = max(p,a[len1-1]);
        }
        while(y)
        {
            b[len2++] = y % 10;
            y /= 10;
            p = max(p,b[len2-1]);
        }
        p++;
        int k = 0;
        for(int i=0; i<5; i++)
        {
            c[i] = (a[i] + b[i] + k) % p;
            k = (a[i] + b[i] + k) / p;
        }
        for(int i=4; i>=0; i--)
        {
            if(c[i])
            {
                printf("%d\n",i+1);
                break;
            }
        }
    }
    return 0;
}