lDosko.cpp

#include <iostream>
#include <cmath>
using namespace std;

bool isPrime(unsigned long long n) {
    unsigned long long sq = sqrt(n) + 1;
    for (unsigned long long i = 2; i < sq; i++)
        if (n % i == 0)
            return false;
    return true;
}

int main(int argc, const char * argv[]) {
    int c = 3;
    unsigned long long s = 1;

    cout << "Oto " << c << " pierwsze liczby doskonale:\n";

    for (unsigned long long i = 2; true; i *= 2) {
        s += i;
        if (isPrime(s)) {
            cout << s*i << endl;
            if (--c == 0)
                break;
        }
    }

    cout << endl << endl;
    return 0;
}