[14406] 소수의 합

using namespace std;
const int MAX = 10000000;
bool c[MAX + 1];
long long solution(int N)
{
    long long answer = 0;
    c[0] = c[1] = true;
	for (int i = 2; i*i <= MAX; i++)
	{
		if (c[i] == false)
		{
			for (int j = i * i; j <= MAX; j = j + i)
				c[j] = true;
		}
	}
    
    for (int i = 2; i <= N; i++)
		if (c[i] == false)
			answer += i;
    return answer;
}