51Nod 1116 K进制下的大数（暴力枚举）

 #include<iostream>
 #include<cstdio>
 #include<algorithm>
 #include<cstring>

 using namespace std;
 const int maxn = 1e5 + ;
 char str[maxn];
 int a[maxn];

 int main()
 {
     int n, i, j, ans, t, tt, ttt, mod;
     scanf("%s", str);
     n = strlen(str);
     ans = ;
     j = ;
     for (i = n - ; i >= ; i--) {
         if (str[i] >= ''&&str[i] <= '') {
             a[j] = str[i] - '';
             ans = max(ans, a[j] + );
         }
         else {
             a[j] = str[i] - 'A' + ;
             ans = max(ans, a[j] + );
         }
         j++;
     }
     a[j] = '\0';
     for (; ans<; ans++) {
         t = ;
         tt = ;
         mod = ans - ;
         for (i = ; i<n; i++) {
             t = (t + a[i] * tt%mod) % mod;
             tt = tt*ans%mod;
         }
         if (t == ) break;
     }
     if (ans < )
         printf("%d\n", ans);
     else
         printf("No Solution\n");
     return ;
 }