2014-05-20 23:24:01 -05:00
|
|
|
// Copyright 2014 The Rust Project Developers. See the COPYRIGHT
|
|
|
|
// file at the top-level directory of this distribution and at
|
|
|
|
// http://rust-lang.org/COPYRIGHT.
|
|
|
|
//
|
|
|
|
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
|
|
|
|
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
|
|
|
|
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
|
|
|
|
// option. This file may not be copied, modified, or distributed
|
|
|
|
// except according to those terms.
|
|
|
|
|
|
|
|
extern crate collections;
|
|
|
|
|
2014-05-29 21:03:06 -05:00
|
|
|
use std::collections::Bitv;
|
2014-05-20 23:24:01 -05:00
|
|
|
|
|
|
|
fn main() {
|
|
|
|
// Generate sieve of Eratosthenes for n up to 1e6
|
|
|
|
let n = 1000000u;
|
2014-07-03 16:32:41 -05:00
|
|
|
let mut sieve = Bitv::with_capacity(n+1, true);
|
2014-05-20 23:24:01 -05:00
|
|
|
let limit: uint = (n as f32).sqrt() as uint;
|
|
|
|
for i in range(2, limit+1) {
|
|
|
|
if sieve[i] {
|
|
|
|
let mut j = 0;
|
|
|
|
while i*i + j*i <= n {
|
2014-07-03 16:32:41 -05:00
|
|
|
sieve.set(i*i+j*i, false);
|
2014-05-20 23:24:01 -05:00
|
|
|
j += 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
for i in range(2, n+1) {
|
|
|
|
if sieve[i] {
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|