[백준] 2581 소수 c++

 

https://www.acmicpc.net/problem/2581

2581번: 소수

 

 

#include <iostream>
#include <algorithm>
#include <vector>
#include <array>
#include <cmath>
#include <functional>
#include <string>
#include <sstream>
#include <numeric>
#include <stack>

using namespace std;
void fastIO();

int main()
{
	int M, N = 0;
	int cnt = 0;
	vector<int> vec;

	cin >> M;
	cin >> N;
	for (auto i = M; i <= N; i++)
	{
		for (auto j = 1; j <= i; j++)
		{
			
			if (i % j == 0)
				cnt++;
		}
		if (cnt == 2)
		{
			vec.push_back(i);
		}
		cnt = 0;
	}
	if (vec.empty())
	{
		cout << "-1" << endl;
	}
	else {
		cout << accumulate(vec.begin(), vec.end(), 0) << endl;
		cout << *min_element(vec.begin(), vec.end()) << endl;
	}
		
}



void fastIO()
{
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
}