Algorithm/알고리즘 예제코드
소수판별
JaeKwan
2021. 9. 16. 14:36
public class Main {
public static boolean isPrime(int num){
for(int i=2; i*i<=num; i++){
if(num % i == 0) return false;
}
return true;
}
public static void main(String[] args) {
System.out.println(isPrime(80));
System.out.println(isPrime(79));
}
}