Submission

Score: 0

User: nga12345

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

Language: cpp

Time: 0.048 second

Submitted On: 2025-10-11 09:31:17

#include <iostream>
#include <vector>
#include <set>
#include <cmath>
#include <algorithm>

using namespace std;

const int MAX_N = 1e7;
vector<bool> is_prime(MAX_N + 1, true);
vector<int> primes;

bool isPrime(int x) {
    return x >= 2 && x <= MAX_N && is_prime[x];
}

int countUniquePrimePermutations(const string& digits) {
    set<int> unique_numbers;
    string s = digits;
    sort(s.begin(), s.end());
    do {
        if (s[0] == '0') continue;
        int number = stoi(s);
        unique_numbers.insert(number);
    } while (next_permutation(s.begin(), s.end()));

    int count = 0;
    for (int num : unique_numbers) {
        if (isPrime(num)) ++count;
    }
    return count;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    is_prime[0] = is_prime[1] = false;
    int limit = sqrt(MAX_N);
    for (int i = 2; i <= limit; ++i) {
        if (!is_prime[i]) continue;
        for (int j = i * i; j <= MAX_N; j += i) {
            is_prime[j] = false;
        }
    }
    for (int i = 2; i <= MAX_N; ++i) {
        if (is_prime[i]) primes.push_back(i);
    }

    int num_cases, length;
    cin >> num_cases;
    cin >> length;

    while (num_cases--) {
        string input;
        cin >> input;
        cout << countUniquePrimePermutations(input) << '\n';
    }

    return 0;
}