Submission

Score: 60

User: namo1022

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

Language: cpp

Time: 0.025 second

Submitted On: 2026-03-19 07:28:27

#include <bits/stdc++.h>

using namespace std;

int n,m;

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

    if(cnt > 0){
        return false;
    }else{
        return true;
    }
    
}

void solve(){
    string n;
    cin >> n;
    int cnt =0;
    sort(n.begin(),n.end());
    do {
        if(isprime(stoi(n))){
            cnt++;
        }
    } while (next_permutation(n.begin(),n.end()));
    cout << cnt << '\n';
}

int  main(){
    cin >> n >> m;
    while(n--){
        solve();
    }
    return 0;
}