백준 2581번 소수

#include <iostream> using namespace std; int main() { int M, N; int sum = 0, count = 0; int min = -1; cin >> M; cin >> N; for (; M <= N; M++) { for (int div = 1; div <= M; div++) { if (M % div == 0) count++; } if (count == 2) { if (min == -1) min = M; sum += M; } count = 0; } if (min == -1) cout << -1 << '\n'; else cout << sum << '\n' << min << '\n'; }

#include <stdio.h> int main() { int M, N; int sum = 0, count = 0; int min = -1; scanf("%d", &M); scanf("%d", &N); for (; M <= N; M++) { for (int div = 1; div <= M; div++) { if (M % div == 0) count++; } if (count == 2) { if (min == -1) min = M; sum += M; } count = 0; } if (min == -1) printf("%d", min); else printf("%d\n%d\n", sum, min); }