forked from daiwb/Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path179.cpp
More file actions
57 lines (50 loc) · 865 Bytes
/
179.cpp
File metadata and controls
57 lines (50 loc) · 865 Bytes
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
#include <iostream>
#include <sstream>
#include <algorithm>
#include <iterator>
#include <vector>
#include <deque>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(a);i>=(b);--i)
typedef long long LL;
LL s2i(string s) {
stringstream ss;
ss << s;
LL res;
ss >> res;
return res;
}
string i2s(LL n) {
stringstream ss;
ss << n;
string res;
ss >> res;
return res;
}
#define MAXN 10000000
int mm[MAXN + 5];
void run() {
FOR(i,2,MAXN-1) mm[i] = 1;
FOR(i,2,MAXN-1) {
int t = i;
while (true) {
mm[t] += 1;
t += i;
if (t >= MAXN) break;
}
}
int res = 0;
FOR(i,2,MAXN-1) {
if (mm[i] == mm[i + 1]) ++res;
}
cout << res << endl;
}
int main () {
run();
return 0;
}