[백준]2581-소수 (설명X)

#include <iostream>
using namespace std;
 
bool isPrime(int number);
 
int main()
{
    int min, max;
    cin >> min >> max;
    int prime = 0;
    int minPrime = 0;
    for (int i = min; i <= max; i++) {
        if (isPrime(i)) {
            if (prime == 0)
                minPrime = i;
            prime += i;
        }
    }
    if (prime == 0)
        cout << -1 << endl;
    else
        cout << prime << endl << minPrime << endl;
}
 
bool isPrime(int number) {
    for (int i = 1; ++i < number;) {
        if (number % i == 0)
            return false;
    }
 
    if (number == 1)
        return false;
    return true;
}