Submission #1295082

---

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>
#include<numeric>

using namespace std;
typedef long long ll;
typedef pair<int, int> Pr;
typedef tuple<int, int, int> T;

map<char, int> m;

int main()
{
	int N;
	ll ans = 1;
	string s1, s2;
	cin >> N >> s1 >> s2;

	for (char c = 'A'; c <= 'Z'; c++) 
		m[c] = -1;

	
	for (int i = 0; i < N; i++) {
		if (s1[i] >= 'A' && s1[i] <= 'Z') {
			if (s2[i] >= '0' && s2[i] <= '9') {
				m[s1[i]] = (int)s2[i];
				s1[i] = s2[i];
			}
		}
			if (s2[i] >= 'A' && s2[i] <= 'Z') {
				if (s1[i] >= '0' && s1[i] <= '9') {
					m[s2[i]] = (int)s1[i];
					s2[i] = s1[i];
				}
			}
	}

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

Submission Info

Judge Result