less than 1 minute read

<-E 1952> Three Divisors

class Solution {
    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;
    }
public:
    bool isThree(int n) {
        int s = sqrt(n);
        return s * s == n && isPrime(s);
    }
};