코딩 연습/백준
소수 구하기-시간초과
blackbearwow
2022. 4. 23. 20:51
import java.util.*;
public class Main
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
int m = sc.nextInt();
int n = sc.nextInt();
for(int i=m; i<=n; i++)
{
if(isPrimeNum(i)) System.out.println(i);
}
sc.close();
}
public static boolean isPrimeNum(int num)
{
int count=0;
for(int i=2; i<num; i++)
{
if(num%i==0) count++;
}
if(count==0) return true;
else return false;
}
}