-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathalmostprime.rs
64 lines (58 loc) · 1.42 KB
/
almostprime.rs
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
62
63
64
struct Scan {
buffer: std::collections::VecDeque<String>,
}
impl Scan {
fn new() -> Scan {
Scan {
buffer: std::collections::VecDeque::new(),
}
}
fn next_line(&self) -> String {
let mut line = String::new();
std::io::stdin().read_line(&mut line).expect("Fail to read");
line
}
fn next<T: std::str::FromStr>(&mut self) -> T {
loop {
if let Some(token) = self.buffer.pop_front() {
break token.parse::<T>().ok().unwrap();
}
let line = self.next_line();
self.buffer = line.split_whitespace().map(String::from).collect();
}
}
fn next_n<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
(0..n).map(|_| self.next::<T>()).collect()
}
}
fn _main() {
let mut scan = Scan::new();
let n: usize = scan.next();
let mut count = [0; 3001];
let mut result = 0usize;
let mut i = 2usize;
while i <= n {
if count[i] == 0 {
let mut j = 2;
while i * j <= n {
count[i * j] += 1;
j += 1;
}
}
i += 1;
}
for i in 2..=n {
if count[i] == 2 {
result += 1;
}
}
println!("{}", result);
}
fn main() {
std::thread::Builder::new()
.stack_size(1 << 23)
.spawn(_main)
.unwrap()
.join()
.unwrap();
}