Submission #501492

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define rep2(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) rep2(i,0,n)
#define inf (1e9)
#define eps (1e-9)

int check(long long x) {
  for (long long i = 2; i * i <= x; i++) {
    if (x % i == 0) {
      return 0;
    }
  }
  return 1;
}

int main() {
  string s; cin >> s;
  map<char,int> m;
  int d[5] = {1,3,5,7,9};
  for (int i = 0; i < s.length(); i++) m[s[i]]++;
  if (m.size() > 5) {
    cout << -1 << endl;
  } else {
    for (int i = 0; i < s.length(); i++) m[s[i]] = -1;
    int x = 0;
    for (int i = 0; i < s.length(); i++) {
      if (m[s[i]] == -1) {
	m[s[i]] = x;
	x++;
      }
    }
    bool hit = false;
    do {
      long long num = 0;
      long long dg = 1;
      for (int i = s.length()-1; i >= 0; i--) {
	num += dg * d[m[s[i]]];
	dg *= 10;
      }
      if (num != 1 && check(num) == 1) {
        cout << num << endl;
	hit = true;
	break;
      }
    } while (next_permutation(d,d+5));
    if (!hit)
      cout << -1 << endl;
  }
  return 0;
}

Submission Info

Judge Result