ABOUT ME

-

Today
-
Yesterday
-
Total
-
  • boj 1929
    카테고리 없음 2021. 8. 15. 03:23
    #include <bits/stdc++.h>
    using namespace std;
    
    bool isPrime(int x) {
    	if (x == 1) return false;
    	if (x == 2 || x == 3) return true;
    	if (x % 2 == 0) return false;
    	for (int i = 3; i * i <= x; i+=2) {
    		if (x % i==0) return false;
    	}
    	return true;
    }
    
    int main(void) {
    	int M, N;
    	cin >> M >> N;
    	for (int i = M; i <= N; i++) {
    		if (isPrime(i)) cout << i << "\n";
    	}
    }

    댓글

Designed by Tistory.