primesfor(life)

#include <iostream>
using namespace std;

//i made that rec function because i don't know how to use pow() from cmath
//anyways, you can use pow() instead of rec()

class Step{
    public:
        unsigned long long rec(int osn, int st){
        unsigned long long br =  1;
        for(int i = 0; i < st; i++){
            br *= osn;
        }
    return br;
    }
};

int main(int argc, char* argv[]) {
    unsigned long long prime, i;
    bool c;
    Step st;

    for(prime = 0; prime < (st.rec(2, 64) - 1); prime++){

        for(i = 0; i < prime / 2; i++){

            if(prime % (prime / 2 + 1 - i) != 0){
                c = true;
            }
            else{
                c = false;
                break;
            }
        }
        if(c){
            std::cout << "prime: " << prime << std::endl;
        }
    }
    return 0;
}