暴力。。没想到啥巧
#include<iostream>
#include<cstdio>
#include<cstring>
#include<stack>
#include<algorithm>
#include<queue>
#include<vector>
#include<cmath>
using namespace std;
int main(){
char s[100001];
scanf("%s",s);
int minn=0,len=strlen(s);
for(int i=0;i<len;i++){
if(s[i]>='0'&&s[i]<='9'){
minn=max(minn,s[i]-'0');
}
else{
minn=max(minn,s[i]-'A'+10);
}
}
for(int i=minn+1;i<=36;i++){
int sum=0;
for(int j=len-1;j>=0;j--){
if(s[j]>='0'&&s[j]<='9'){
sum=sum*i+s[j]-'0';
sum%=(i-1);
}
else{
sum=sum*i+s[j]-'A'+10;
sum%=(i-1);
}
}
if(sum==0){
printf("%d",i);
return 0;
}
}
printf("No Solution");
return 0;
}