Submission #1813703

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
typedef long long LL;

int N;
string s1,s2;

bool check(char a){
     if((0<=(a-'A'))&&(26>(a-'A')))return true;
     return false;
}

map<int,int>m;
int main(){
    cin>>N;
    cin>>s1>>s2;
    REP(i,N){
        REP(j,N){
            if((0<=(s1[j]-'A'))&&(26>(s1[j]-'A'))){
                char aa=s1[j];
                REP(k,N){
                    //cout<<s1[k]<<" "<<aa<<endl;
                    if(s1[k]==aa)s1[k]=s2[j];
                    if(s2[k]==aa)s2[k]=s2[j];
                }
            }
            if((0<=(s2[j]-'A'))&&(26>(s2[j]-'A'))){
                char aa=s2[j];
                REP(k,N){
                    if(s1[k]==aa)s1[k]=s1[j];
                    if(s2[k]==aa)s2[k]=s1[j];
                }
            }
        }
    }
    bool c=false;
    LL ans=1;
    /*REP(i,10){
        m[i]++;
    }*/
    REP(i,N){
        if(check(s1[i])){
           //cout<<s1[i]<<endl;
           m[s1[i]]++;
        }
    }
    int si=m.size();
    if((0<=(s1[0]-'A'))&&(26>(s1[0]-'A'))){
       ans=9;
       si--;
    }
    cout<<ans;
    REP(i,si)cout<<0;
    cout<<endl;
    return(0);
}

Submission Info

Judge Result