|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
|
#include <iostream>
#include <vector>
#define MAXX 4000001
using namespace std;
bool isPrime[MAXX];
int prime[MAXX];
void findPrime(int n) {
for (int i = 2; i <= n; i++) {
if (!isPrime[i]) continue;
for (int j = i + i; j <= n; j += i) {
if (!isPrime[j]) continue;
isPrime[j] = false;
}
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 2; i <= n; i++) {
isPrime[i] = true;
}
findPrime(n);
int idx = 0;
//cout << "debug";
for (int i = 2; i <= n; i++) {
if (isPrime[i]) {
prime[idx++] = i;
/*cout << i << ' ';*/
}
}
//cout << '\n';
int left = 0, right = 0;
int sum = 0;
int cnt = 0;
if (isPrime[n])
cnt++;
while (left <= right && right < idx) {
if (sum < n) {
if (right <= idx-1)
; sum += prime[right++];
}
else {
if (sum == n) cnt++;
sum -= prime[left++];
}
}
cout << cnt << '\n';
return 0;
}
http://colorscripter.com/info#e" target="_blank" style="color:#4f4f4ftext-decoration:none">Colored by Color Scripter
|
BOJ/C++