[C++] 백준 1929번 : 소수 구하기

https://www.acmicpc.net/problem/1929

#include <iostream>

#include <math.h>

using namespace std;

int main() {

cin.tie(NULL);

ios::sync_with_stdio(false);

long long m,n;

cin >> m >> n;

long long cnt=2,flag=0;

for (int i = m; i <= n; i++) {

while (cnt <= sqrt(i)) {

if (i%cnt == 0) {

flag = 1;

break;

}

cnt++;

}

if (i == 1)

flag = 1;

if (flag == 0)

cout << i << "\n";

cnt = 2;

flag = 0;

}

}