2581소수

#include <iostream>
#include <vector>
#include <cmath>
using namespace std;



int main() {
	int m = 60;
	int n = 100;
	vector<int>v(n + 1);
	for (int i = 2; i <= n; i++) {
		v[i] = i;
	}
	//2의 배수부터 지워준댜
	for (int i = 2; i <= sqrt(n); i++) {
		if (v[i] = 0)continue;
		for (int j = i + i; j <= n; j = i + j) {
			v[j] = 0;
		}
	}
	int minN = 0;
	for (int i = 60; i <= 100; i++) {
		if (v[i] != 0) {
			minN = v[i];
			break;
		}
	}
	int sum = 0;
	for (int i = 60; i <= 100; i++) {
		if (v[i] == 0)continue;
		sum += v[i];
	}
	cout << sum << "\n" << minN;

	return 0;
}