Submission

Score: 60

User: navysrimuang

Problemset: การเรียงสับเปลี่ยน

Language: cpp

Time: 0.030 second

Submitted On: 2026-01-15 15:02:42

#include<bits/stdc++.h>
using namespace std;
int main(){
	
	int t,n;
	cin >> t >> n;
	const long long MX = 10000000;
	vector<bool> sieve(MX+1,1);
	sieve[0] = sieve[1] = 0;
	for(long long i = 2;i*i<=MX;i++){
		if(sieve[i]){
			for(long long j = 2*i;j<=MX;j+=i){
				sieve[j] = 0;
			}
		}
	}

	while(t--){

		string s;
		cin >> s;
		sort(s.begin(),s.end());
		long long  cnt = 0;
		do{
			long long  d = stoi(s);
			if(sieve[d]) cnt++;
		}while(next_permutation(s.begin(),s.end()));
		cout << cnt << "\n";
	}
	return 0;
}