Submission #1371401

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
#include<cassert>
using namespace std;
int inf = 1000000000;

int main(void) {

  int n;
  cin >> n;
  string s, t;
  cin >> s >> t;

  for(int i=0; i<n; i++){
    bool a = false;
    bool b = false;
    if( '0' <= s[i] && s[i] <= '9' ) a = true;
    if( '0' <= t[i] && t[i] <= '9' ) b = true;

    if( !a && !b ){
      char p = s[i];
      char q = t[i];
      for(int j=0; j<n; j++){
        if( s[j] == p ) s[j] = q;
        if( t[j] == p ) t[j] = q;
      }
    }
  }
  // cerr << s << endl << t << endl;
  for(int i=0; i<n; i++){
    bool a = false;
    bool b = false;
    if( '0' <= s[i] && s[i] <= '9' ) a = true;
    if( '0' <= t[i] && t[i] <= '9' ) b = true;

    if( a && !b ){
      char p = s[i];
      char q = t[i];
      for(int j=0; j<n; j++){
        if( s[j] == q ) s[j] = p;
        if( t[j] == q ) t[j] = p;
      }
    }
    if( !a && b ){
      char p = s[i];
      char q = t[i];
      for(int j=0; j<n; j++){
        if( s[j] == p ) s[j] = q;
        if( t[j] == p ) t[j] = q;
      }
    }
  }
  long long int cnt = 1;
  for(int i=0; i<n; i++){
    if( '0' <= s[i] && s[i] <= '9' ) continue;

    if( i == 0 ) cnt *= 9;
    else cnt *= 10;
    for(int j=0; j<n; j++){
      if( s[j] == t[i] ) s[j] = '0';
    }

  }

  cout << cnt << endl;
  return 0;
}


// EOF

Submission Info

Judge Result