Submission

PPPPPxxPxx

Score: 60

User: meme_boi2

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

Language: cpp

Time: 0.007 second

Submitted On: 2025-03-31 12:48:42

//I love somchai kongtum
#include <bits/stdc++.h>
using namespace std;
int prime(int t){
	if(t == 1) return 0;
	for(int i = 2; i <= sqrt(t); i++){
		if(t%i == 0){
			return 0;
		}
	}
	return 1;
}

int permute(string str)
{
   sort(str.begin(), str.end());
	int t = 0;
   do{
   	if(prime(stoi(str))){
   		t = t + 1;
	   }
   }while(next_permutation(str.begin(), str.end()));
   return t;
}

int main() {
    int n, k;
    cin >> n >> k;
    vector<int> t;

    for (int i = 0; i < n; i++) {
        string p;
        cin >> p;
        t.push_back(permute(p));
    }

    for (int i = 0; i < n; i++) {
        cout << t.at(i) << "\n";
    }
}