백준 2581번: 소수

package BOJ.step9;

import java.util.Scanner;

public class BOJ2581 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int M = sc.nextInt();
        int N = sc.nextInt();

        int sum = 0;
        int Min = Integer.MAX_VALUE;



        for (int i = M; i <= N; i++) {
            boolean isPrime = true;

            if (i == 1) {
                isPrime = false;
            } else {
                for (int j = 2; j < i; j++) {
                    if (i % j == 0) {
                        isPrime = false;
                        break;
                    }
                }
            }
            if (isPrime) {
                sum += i;
                if (i < Min) {
                    Min = i;
                }
            }

        }


        if (sum == 0) {
            System.out.println(-1);
        } else {
            System.out.println(sum);
            System.out.println(Min);

        }




    }
}