2581번: 소수

#include <cstdio>

using namespace std;

#define max 10000

int main()

{

int m, n, sum = 0, min = 10000;

bool num[max + 1];

for (int i = 0; i <= max; ++i)

num[i] = 1;

for (int i = 4; i <= max; i += 2)

num[i] = 0;

for (int i = 3; i <= max; i += 2)

if (num[i] == 1)

for (int j = i*i; j <= max; j += 2 * i)

num[j] = 0;

for (scanf("%d %d", &m, &n), num[1] = 0; m <= n; ++m)

if (num[m] == 1)

{

sum += m;

min = (min > m) ? m : min;

}

(sum == 0) ? printf("-1") : printf("%d\n%d", sum, min);

}