洛谷P1013 [NOIP1998 提高组] 进制位

洛谷P1013 [NOIP1998 提高组] 进制位

没什么说的，就是先找0，再找1，然后用递归找其余的数，思路不是很难，就是麻烦……
题目传送门

#include<iostream>
#include<string>
#include<map>
#include<stack>
using namespace std;
const int maxn = 11;
int shu[maxn];
char sign_shu[maxn];
string mp[maxn][maxn];
map<char,int>cor;
int n;
bool find(char ch,string s){
	for(int i=0;i<s.length();i++){
		if(s[i] == ch) return true;
	}
	return false;
}
int Find(char ch){
	for(int i=1;i<=n;i++){
		if(mp[1][i][0]==ch) return i;
	}
	return -1;
}
int to_sum(int a,int b){
	int c = a + b;
	int ans = 0;
	stack<int>st;
	if(c<(n-1)) return c;
	while(c){
		st.push(c%(n-1));
		c /= (n-1);
	}
	while(!st.empty()){
		ans = ans*10 + st.top();
		st.pop();
	}
	return ans;
}
bool judge(char i,char j,string sign){
	int a = cor[i];
	int b = cor[j];
	int c = to_sum(a,b);
	string ans = "";
	if(c==0) ans = char(sign_shu[0]);
	while(c){
		ans = char(sign_shu[c%10]) + ans;
		c/=10;
	}
	if(ans!=sign) return false;
	else return true;
}
int main(){
	cin >> n;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			cin >> mp[i][j];
		}
	}
	int shu_0 = -1;
	for(int i=2;i<=n;i++){
		int j;
		for(j=2;j<=n;j++){
			if(mp[i][j]==mp[1][j]) continue;
			else break;
		}
		if(j>n){
			shu_0 = i;
			break;
		}
	}
	if(shu_0==-1){
		cout << "ERROR!" << endl;
		return 0; 
	}
	sign_shu[0] = mp[1][shu_0][0];
	shu[0] = shu_0;
	bool flag = false;
	for(int i=2;i<=n;i++){
		for(int j=2;j<=n;j++){
			if(find(sign_shu[0],mp[i][j]) && !flag && mp[i][j].size()==2){
				char _1 = mp[i][j][0];
				sign_shu[1] = _1;
				flag = true;
			}
			else if(find(sign_shu[0],mp[i][j]) && flag && mp[i][j].size()==2){
				if(mp[i][j][0]!=sign_shu[1]){
					cout << sign_shu[1] << endl;
					cout << "ERROR!" << endl;
					return 0;	
				}
			}
		}
	}
	for(int i=1;i<=n;i++){
		if(mp[1][i][0]==sign_shu[1]){
			shu[1] = i;
			break;
		}
	}
	for(int i=1;i<=n;i++){
		if(mp[1][i][0] == sign_shu[1]){
			char _2 = mp[i][i][0];
			sign_shu[2] = _2;
		}
	}
	for(int k=2;k<=n;k++){
		sign_shu[k] = mp[shu[k-1]][shu[1]][0];
		shu[k] = Find(sign_shu[k]);
		if(shu[k]==-1){
			cout << "ERROR!" << endl;
			return 0;
		}
	}
	for(int i=0;i<n-1;i++){
		cor[sign_shu[i]] = i;
	}
	for(int i=2;i<=n;i++){
		for(int j=2;j<=n;j++){
			if(!judge(mp[1][i][0],mp[j][1][0],mp[j][i])){
				cout << "ERROR!" << endl;
				return 0;
			}
		}
	}
	for(int i=2;i<=n;i++){
		char ch = mp[1][i][0];
		printf("%c=%d ",ch,cor[ch]);
	}
	cout << endl;
	cout << n-1 << endl;
	return 0;
}