Submission

Score: 60

User: patsa_v

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

Language: cpp

Time: 0.006 second

Submitted On: 2025-10-15 12:47:19

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

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

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int m,n;
    cin >> m >> n;  

    vector<string> v;
    for(int i = 0;i<m;i++){
        string s;
        cin >> s;
        v.push_back(s);
    }

    
    for(string c:v){
        int count = 0;
        sort(c.begin(),c.end());
        do{
            if(isprime(stoi(c))){
                count ++;
            }
        }while(next_permutation(c.begin(),c.end()));
        cout << count <<'\n';
    }
    
    return 0;
}