Submission #1293376

---

Source Code Expand

#include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <tuple>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <complex>
#include <iterator>
#include <array>
#include <memory>
#include <stack>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
#define MAX 9999999
using namespace std;
typedef pair<int, int> pii;
typedef pair<double,double>pdd;
typedef pair<ll,ll>pll;
int main(){
    int n; cin>>n;
    string a,b;
    cin>>a;
    cin>>b;
    vb used(10000,true);
    map<char,int>mp;
    rep(i,a.size()){
        if(!('A'<=a[i]&&a[i]<='Z'))continue;
        rep(j,a.size()){
            if(i!=j&&a[i]==a[j]){
                a[j]=b[i];
            }
        }
        a[i]=b[i];
    }
    //cout<<a<<" "<<b<<endl;
    ll temp=1;
    rep(i,a.size()){
        if(i==0 && ('A'<=a[i]&&a[i]<='Z')){
            temp*=9;
            used[a[i]]=false;
        }else if(!('A'<=a[i]&&a[i]<='Z')) continue;
        else{
            if(used[a[i]])temp*=10;
            used[a[i]]=false;
        }
    }
    cout<<temp<<endl;
}

Submission Info

Judge Result