結果

問題 No.2609 Decreasing GCDs
ユーザー naut3
提出日時 2024-01-19 22:22:05
言語 Rust
(1.83.0 + proconio)
結果
WA  
実行時間 -
コード長 2,892 bytes
コンパイル時間 13,216 ms
コンパイル使用メモリ 395,176 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-28 04:43:13
合計ジャッジ時間 15,031 ms
ジャッジサーバーID
(参考情報)
judge4 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 7 WA * 15
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unnecessary parentheses around `for` iterator expression
  --> src/main.rs:39:22
   |
39 |             for k in (1..100_010) {
   |                      ^          ^
   |
   = note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
   |
39 -             for k in (1..100_010) {
39 +             for k in 1..100_010 {
   |

warning: unnecessary parentheses around `for` iterator expression
  --> src/main.rs:48:22
   |
48 |             for k in (1..100_010) {
   |                      ^          ^
   |
help: remove these parentheses
   |
48 -             for k in (1..100_010) {
48 +             for k in 1..100_010 {
   |

ソースコード

diff #
プレゼンテーションモードにする

#![allow(non_snake_case, unused_imports, unused_must_use)]
use std::io::{self, prelude::*};
use std::str;
fn main() {
let (stdin, stdout) = (io::stdin(), io::stdout());
let mut scan = Scanner::new(stdin.lock());
let mut out = io::BufWriter::new(stdout.lock());
macro_rules! input {
($T: ty) => {
scan.token::<$T>()
};
($T: ty, $N: expr) => {
(0..$N).map(|_| scan.token::<$T>()).collect::<Vec<_>>()
};
}
let N = input!(usize);
let is_prime = sieve_of_eratosthenes(100_010);
let primes = (0..100_010).filter(|&i| is_prime[i]).collect::<Vec<_>>();
let mut gcds = primes[0..N - 1].iter().map(|&p| p).collect::<Vec<_>>();
gcds.reverse();
let mut ans = vec![0; N];
ans[0] = 1 * gcds[0];
for i in 1..N {
let prev = ans[i - 1];
if i < N - 1 {
let g1 = gcds[i - 1];
let g2 = gcds[i];
for k in (1..100_010) {
if gcd(prev, g1 * g2 * k) == g1 && prev < g1 * g2 * k {
ans[i] = g1 * g2 * k;
break;
}
}
} else {
let g1 = gcds[i - 1];
for k in (1..100_010) {
if gcd(prev, g1 * k) == g1 && prev < g1 * k {
ans[i] = g1 * k;
break;
}
}
}
}
writeln!(
out,
"{}",
ans.iter()
.map(|x| x.to_string())
.collect::<Vec<_>>()
.join(" ")
);
}
fn sieve_of_eratosthenes(n: usize) -> Vec<bool> {
let mut ret = vec![true; n + 1];
ret[0] = false;
ret[1] = false;
for p in 2..=n {
if !ret[p] {
continue;
}
for q in (2 * p..=n).step_by(p) {
ret[q] = false;
}
}
return ret;
}
fn gcd(a: usize, b: usize) -> usize {
if a < b {
return gcd(b, a);
}
if b == 0 {
return a;
} else {
return gcd(b, a % b);
}
}
struct Scanner<R> {
reader: R,
buf_str: Vec<u8>,
buf_iter: str::SplitWhitespace<'static>,
}
impl<R: BufRead> Scanner<R> {
fn new(reader: R) -> Self {
Self {
reader,
buf_str: vec![],
buf_iter: "".split_whitespace(),
}
}
fn token<T: str::FromStr>(&mut self) -> T {
loop {
if let Some(token) = self.buf_iter.next() {
return token.parse().ok().expect("Failed parse");
}
self.buf_str.clear();
self.reader
.read_until(b'\n', &mut self.buf_str)
.expect("Failed read");
self.buf_iter = unsafe {
let slice = str::from_utf8_unchecked(&self.buf_str);
std::mem::transmute(slice.split_whitespace())
}
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0