Elementele prime care au cifre distincte

#include <iostream>
using namespace std;

bool prim(int x) {
    if (x < 2) return false;
    for (int d = 2; d * d <= x; d++)
        if (x % d == 0) return false;
    return true;
}

bool cifreDistincte(int x) {
    bool vazut[10] = {false};
    do {
        int c = x % 10;
        if (vazut[c]) return false;
        vazut[c] = true;
        x /= 10;
    } while (x > 0);
    return true;
}

int main() {
    int n, a[101];
    cin >> n;
    for (int i = 0; i < n; i++)
        cin >> a[i];

    bool gasit = false;
    for (int i = 0; i < n; i++)
        if (prim(a[i]) && cifreDistincte(a[i])) {
            cout << a[i] << ' ';
            gasit = true;
        }

    if (!gasit) cout << "NU EXISTA";
    return 0;
}