Số nguyên tố Mersenne

#include <iostream>
#include <cmath>
using namespace std;
int nguyenTo(int n) {
    if (n < 2) return 0;
    for (int i = 2; i <= sqrt(n); i++) {
        if (n % i == 0) return 0;
    }
    return 1;
}
int Mersenne(int n){
    int i = 0;
    n += 1;
    while (n > pow(2, i)) {
        i++;
    }
    if (n == pow(2, i))
        return 1;
    else return 0;
}
int main() {
    freopen("MERSENNE.INP","r",stdin);
    freopen("MERSENNE.OUT","w",stdout);
    int m, n;
    cin >> m >> n;
    if (nguyenTo(n) && Mersenne(n))
        cout << 1 << endl;
    else cout << 0 << endl;
    for (int i = 2; i <= n; i++) {
        if (nguyenTo(i) && Mersenne(i))
            cout << i << " ";
    }
    cout << endl;
    for (int i = m; i <= n; i++) {
        if (nguyenTo(i) && Mersenne(i))
            cout << i << " ";
    }
    return 0;
}