Submission #1293297

---

Source Code Expand

#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "math.h"
#include "utility"
#include "string"
#include "map"
#include "unordered_map"
#include "iomanip"
#include "random"

using namespace std;
const long long int MOD = 1000000007;

int N;
string s[2];
bool num[26][10];
bool appear[26];
bool con[26][26];
long long int ans = 1;

int main() {
	ios::sync_with_stdio(false);
	cin >> N;
	cin >> s[0];
	cin >> s[1];
	for (int i = 0; i < 26; i++)
		for (int j = 0; j < 10; j++)num[i][j] = true;
	for (auto i : s[0])	if (i >= 'A'&&i <= 'Z')appear[i - 'A'] = true;
	for (auto i : s[1])	if (i >= 'A'&&i <= 'Z')appear[i - 'A'] = true;
	num[s[0][0] - 'A'][0] = false;
	num[s[1][0] - 'A'][0] = false;
	for (int i = 0; i < s[0].size(); i++) {
		if (s[0][i] >= 'A'&&s[0][i] <= 'Z'&&s[1][i] >= 'A'&&s[1][i] <= 'Z') {
			con[s[0][i] - 'A'][s[1][i] - 'A'] = true;
			con[s[1][i] - 'A'][s[0][i] - 'A'] = true;
		}
		else if (s[0][i] >= '0'&&s[0][i] <= '9') {
			if (s[1][i] >= 'A'&&s[1][i] <= 'Z') {
				for (int j = 0; j < 10; j++)num[s[1][i] - 'A'][j] = false;
				num[s[1][i] - 'A'][s[0][i] - '0'] = true;
			}
		}
		else {
			if (s[0][i] >= 'A'&&s[0][i] <= 'Z') {
				for (int j = 0; j < 10; j++)num[s[0][i] - 'A'][j] = false;
				num[s[0][i] - 'A'][s[1][i] - '0'] = true;
			}
		}
	}
	for (int i = 25; i >= 0; i--) {
		for (int j = i + 1; j < 26; j++) {
			if (con[i][j]) {
				//cout << char('A' + i) << " " << char('A' + j) << endl;
				appear[j] = false;
				for (int k = 0; k < 10; k++) {
					num[i][k] &= num[j][k];
				}
			}
		}
	}
	for (int i = 0; i < 26; i++) {
		if (appear[i]) {
			long long int box = 0;
			for (int j = 0; j < 10; j++) {
				if (num[i][j])box++;
			}
			ans *= box;
			//cout << char('A' + i) << " " << box << endl;
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result