[백준/Java] 2581번 소수

-Code

import java.util.Scanner;

public class BOJ2581 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        int sum = 0;
        int minPrime = Integer.MAX_VALUE;

        for (int num = n; num <= m; num++) {
            if (isPrime(num)) {
                sum += num;
                if (minPrime > num) {
                    minPrime = num;
                }
            }
        }
        if (sum == 0) {
            System.out.println(-1);
        } else {
            System.out.println(sum);
            System.out.println(minPrime);
        }
    }

    private static boolean isPrime(int n) {
        if (n == 1) {
            return false;
        }
        for (int i = 2; i < n; i++) {
            if (n % i == 0) {
                return false;
            }
        }
        return true;
    }

}