Submission #1295112

---

Source Code Expand

#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;

int main()
{
	int N;  cin >> N;
	map<char, char> m1;
	string s1, s2;
	cin >> s1 >> s2;

	for (int i = 0; i < N; i++) {
		if (s1[i] >= 'A' && s1[i] <= 'Z' && s2[i] >= '0' && s2[i] <= '9') {
			m1[s1[i]] = s2[i];
		}
		if (s2[i] >= 'A' && s2[i] <= 'Z' && s1[i] >= '0' && s1[i] <= '9') {
			m1[s2[i]] = s1[i];
		}
	}
	for (int j = 0; j < 1000; j++) {
		for (int i = 0; i < N; i++) {
			if (m1.count(s1[i]) != 0 && m1.count(s2[i]) == 0) {
				m1[s2[i]] = m1[s1[i]];
			}
			if (m1.count(s2[i]) != 0 && m1.count(s1[i]) == 0) {
				m1[s1[i]] = m1[s2[i]];
			}
		}
	}

	ll ans = 1;
	for (int i = 0; i < N; i++) {
		if (s1[i] >= 'A' && s1[i] <= 'Z' && m1.count(s1[i]) == 0&& 
			s2[i] >= 'A' && s2[i] <= 'Z' && m1.count(s2[i]) == 0) {
			if (i == 0)ans *= 9;
			else ans *= 10;
			m1[s1[i]] = 1;
			m1[s2[i]] = 1;
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result