Submission #501793

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <set>
#include <algorithm>
#define ll long long 

using namespace std;

int indexof(vector<char> &s, char c){
	for(int i=0;i<s.size();i++){
		if(s[i]==c) return i;
	}
	return -1;
}

ll make_num( string &str,vector<char> &s)
{
	ll num = 0;
	for(char c : str){
		num*=10;
		int idx = indexof(s,c);
		ll n = idx*2+1;
		num += n;
	}
	return num;
}

bool check(ll n)
{
	if(n%2==0) return false;
	for(ll i=3;i*i<=n;i+=2){
		if( n%i == 0 ){
			return false;
		}
	}
	return true;
}

int main() {

	string str;
	cin >> str;
	
	vector<char> s;
	for( char c : str ){
		auto f = find( s.begin(),s.end(), c);
		if( f==s.end() ){
			s.push_back(c);
		}
	}
	
	if( s.size()>5 ){
		cout << "-1" << endl;
		return 0;
	}
	char a='A';
	while(s.size()<5){
		s.push_back(a);
		a++;
	}

	sort(s.begin(),s.end());
	do{
		// for(auto c:s)cout<<c;
		// cout<<endl;
		ll n=make_num(str,s);
		if( check(n) ){
			cout << n << endl;
			return 0;
		}
		
	}while(next_permutation(s.begin(),s.end()));

	cout << "-1" << endl;

	return 0;
}

Submission Info

Judge Result