Submission #1293417

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n;
	string s1, s2;
	cin >> n >> s1 >> s2;
	vector<int> a(26, -1);
	vector<int> b(n, -1);
	bool update = true;
	while (update) {
		update = false;
		for (int i = 0; i < n; i++) {
			if (s1[i] >= 'A' && s2[i] >= 'A') {
				if ((a[s1[i] - 'A'] != -1) ^ (a[s2[i] - 'A'] != -1)) {
					update = true;
					if (a[s1[i] - 'A'] != -1) {
						a[s2[i] - 'A'] = a[s1[i] - 'A'];
						b[i] = a[s1[i] - 'A'];
					} else {
						a[s1[i] - 'A'] = a[s2[i] - 'A'];
						b[i] = a[s2[i] - 'A'];
					}
				}
			} else if (s1[i] >= 'A') {
				if (a[s1[i] - 'A'] == -1) {
					update = true;
					a[s1[i] - 'A'] = s2[i] - '0';
					b[i] = s2[i] - '0';
				}
			} else if (s2[i] >= 'A') {
				if (a[s2[i] - 'A'] == -1) {
					update = true;
					a[s2[i] - 'A'] = s1[i] - '0';
					b[i] = s1[i] - '0';
				}
			} else {
				if (b[i] == -1) b[i] = s1[i] - '0';
			}
		}
	}
	ll ans = 1;
	for (int i = 0; i < n; i++) {
		if (b[i] != -1 && a[s1[i] - 'A'] == -1 && a[s2[i] - 'A'] == -1) continue;
		ans *= 10 - (i == 0);
		a[s1[i] - 'A'] = 10;
		a[s2[i] - 'A'] = 10;
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result