Submission #501819

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <time.h>
 
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define FFOR(i,a,b) for(int i=(a);i<=(b);i++)
#define REP(i,b) FOR(i,0,b)
#define RREP(i,b) FFOR(i,1,b)
#define PB push_back
#define F first
#define S second
#define BE(c) c.begin(),c.end()
using namespace std;
typedef long long LL;
typedef LL ut;
typedef long double ld;
typedef pair<ut,ut> pr;
typedef vector<pr> Vpr;
typedef vector<ut> VI;
typedef pair<ut,pr> ppr;
typedef priority_queue<pr,Vpr, greater<pr> > PQ;
const int SIZE=5+3*1e+4;
const ut INF=1<<30;
const ld eps=1e-6;
const LL mod=1e+9 + 7;

map<char, bool> check;
int cnt, L;
LL tenb[10];
string s;
VI data;

bool is_prime(LL n){
	for(int i = 2; i * i <= n; ++i){
		if(n % i == 0)
			return false;
	}
	return n != 1;
}


int main() {
	cin >> s;
	REP(i,s.size()){
		if(!check[s[i]]){
			check[s[i]] = true;
			cnt++;
		}
	}
	if(cnt > 5){
		cout << "-1" << endl;
		return 0;
	}
	L = s.size();
	REP(i,L)
		tenb[i] = pow(10, i);
	
	REP(i,5)
		data.push_back(i * 2 + 1);
	
	int loop = 1e+5 * 2;
	while(loop--){
    	time_t nowtime;
    	time(&nowtime);
    	srand((int)nowtime);
		random_shuffle(BE(data));

		LL res = 0;
		map<char, int> nums;
		int c = 0;
		REP(i,L){
			if(nums[s[i]] == 0){
				nums[s[i]] = data[c];
				c++;
			}
			res += nums[s[i]] * tenb[L-i-1];
		}
		if(is_prime(res)){
			cout << res << endl;
			return 0;
		}
	}
	cout << "-1" << endl;
	return 0;
}

Submission Info

Judge Result