#945216 (Rust) No.2609 Decreasing GCDs

• 問題: No.2609 Decreasing GCDs
• ユーザー: Moss_Local
• 提出日時: 2024-01-19 23:04:35
• 言語: Rust (1.77.0)
• 結果: AC
• 実行時間: 1 ms / 1,000 ms
• コード長: 7,084 bytes
• コンパイル時間: 1,020 ms
• コンパイル使用メモリ: 191,100 KB
• 実行使用メモリ: 6,676 KB
• 最終ジャッジ日時: 2024-01-19 23:04:38
• 合計ジャッジ時間: 2,374 ms
• ジャッジサーバーID （参考情報）: judge14 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,676 KB
testcase_01	AC	1 ms; 6,676 KB
testcase_02	AC	0 ms; 6,676 KB
testcase_03	AC	1 ms; 6,676 KB
testcase_04	AC	1 ms; 6,676 KB
testcase_05	AC	1 ms; 6,676 KB
testcase_06	AC	1 ms; 6,676 KB
testcase_07	AC	1 ms; 6,676 KB
testcase_08	AC	1 ms; 6,676 KB
testcase_09	AC	1 ms; 6,676 KB
testcase_10	AC	1 ms; 6,676 KB
testcase_11	AC	1 ms; 6,676 KB
testcase_12	AC	1 ms; 6,676 KB
testcase_13	AC	1 ms; 6,676 KB
testcase_14	AC	1 ms; 6,676 KB
testcase_15	AC	1 ms; 6,676 KB
testcase_16	AC	1 ms; 6,676 KB
testcase_17	AC	1 ms; 6,676 KB
testcase_18	AC	1 ms; 6,676 KB
testcase_19	AC	1 ms; 6,676 KB
testcase_20	AC	1 ms; 6,676 KB
testcase_21	AC	1 ms; 6,676 KB
testcase_22	AC	1 ms; 6,676 KB

コンパイルメッセージ

warning: unnecessary parentheses around `if` condition
   --> Main.rs:213:8
    |
213 |     if (a < b) {
    |        ^     ^
    |
    = note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
    |
213 -     if (a < b) {
213 +     if a < b {
    |

warning: unused variable: `res`
   --> Main.rs:260:13
    |
260 |     let mut res = vec![n as i64];
    |             ^^^ help: if this is intentional, prefix it with an underscore: `_res`
    |
    = note: `#[warn(unused_variables)]` on by default

warning: unused variable: `i`
   --> Main.rs:263:9
    |
263 |     for i in 0..n {
    |         ^ help: if this is intentional, prefix it with an underscore: `_i`

warning: variable does not need to be mutable
   --> Main.rs:260:9
    |
260 |     let mut res = vec![n as i64];
    |         ----^^^
    |         |
    |         help: remove this `mut`
    |
    = note: `#[warn(unused_mut)]` on by default

warning: comparison is useless due to type limits
   --> Main.rs:229:8
    |
229 |     if n >= 0 {
    |        ^^^^^^
    |
    = note: `#[warn(unused_comparisons)]` on by default

warning: 5 warnings emitted

ソースコード

// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
// use core::num;
use std::cmp::*;
use std::fmt::*;
use std::hash::*;
use std::iter::FromIterator;
use std::*;
use std::{cmp, collections, fmt, io, iter, ops, str};
const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
const LINF: i64 = 2147483647;
const INF128: i128 = 1223372036854775807000000000000;
const MOD1: i64 = 1000000007;
const MOD9: i64 = 998244353;
const MOD: i64 = MOD9;
// const MOD: i64 = MOD2;
const UMOD: usize = MOD as usize;
const M_PI: f64 = 3.14159265358979323846;

// use proconio::input;
// const MOD: i64 = INF;

use cmp::Ordering::*;
use std::collections::*;

use std::io::stdin;
use std::io::stdout;
use std::io::Write;

macro_rules! p {
    ($x:expr) => {
        //if expr
        println!("{}", $x);
    };
}

macro_rules! vp {
    // vector print separate with space
    ($x:expr) => {
        println!(
            "{}",
            $x.iter()
                .map(|x| x.to_string())
                .collect::<Vec<_>>()
                .join(" ")
        );
    };
}

macro_rules! d {
    ($x:expr) => {
        eprintln!("{:?}", $x);
    };
}
macro_rules! yn {
    ($val:expr) => {
        if $val {
            println!("Yes");
        } else {
            println!("No");
        }
    };
}

macro_rules! map{
    // declear btreemap
    ($($key:expr => $val:expr),*) => {
        {
            let mut map = ::std::collections::BTreeMap::new();
            $(
                map.insert($key, $val);
            )*
            map
        }
    };
}

macro_rules! set{
    // declear btreemap
    ($($key:expr),*) => {
        {
            let mut set = ::std::collections::BTreeSet::new();
            $(
                set.insert($key);
            )*
            set
        }
    };
}

fn main() {
    solve();
}

// use str::Chars;
#[allow(dead_code)]
fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

#[allow(dead_code)]
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

#[allow(dead_code)]
fn read_mat<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
    (0..n).map(|_| read_vec()).collect()
}

#[allow(dead_code)]
fn readii() -> (i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}

#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

#[allow(dead_code)]
fn readff() -> (f64, f64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<f64>().unwrap(),
        iter.next().unwrap().parse::<f64>().unwrap(),
    )
}

fn readcc() -> (char, char) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<char>().unwrap(),
        iter.next().unwrap().parse::<char>().unwrap(),
    )
}

fn readuuu() -> (usize, usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}
#[allow(dead_code)]
fn readiiii() -> (i64, i64, i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}

#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();

    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

#[allow(dead_code)]
pub fn gcd(mut a: i64, mut b: i64) -> i64 {
    if (a < b) {
        let t = a;
        a = b;
        b = t;
    }
    if b == 0 {
        a
    } else {
        gcd(b, a % b)
    }
}

fn prime_table(n: usize) -> Vec<usize> {
    let mut is_prime = vec![true; n + 1];
    let mut res = vec![0 as usize; 0];

    if n >= 0 {
        is_prime[0] = false;
    }
    if n >= 1 {
        is_prime[1] = false;
    }
    let mut i = 2 as usize;
    while i * i <= n {
        if !is_prime[i] {
            i += 1;
            continue;
        }
        // println!("{:?}", "call");

        let mut j = i + i as usize;
        while j <= n {
            is_prime[j] = false;
            j += i;
        }
        i += 1;
    }
    for i in 0..n {
        if is_prime[i] == true {
            res.push(i);
        }
    }

    return res;
}
fn solve() {
    let n: usize = read();
    let mut res = vec![n as i64];
    let mut pt = prime_table(110);
    let mut data = vec![];
    for i in 0..n {
        data.push(pt.pop().unwrap());
    }

    let mut x = data[0] as i64;
    let mut prev = x;
    let mut res = vec![x];
    // d!(data);
    for i in 1..n {
        let y = data[i] as i64;
        let g = x * y / gcd(x, y);
        let f = |ix: i64| -> bool {
            return ix * g > prev;
        };

        let mut ok = LINF;
        let mut ng = 1;

        while (ng - ok).abs() > 1 {
            let mid = (ok + ng) / 2;
            if f(mid) {
                ok = mid;
            } else {
                ng = mid;
            }
        }
        while gcd(ok * g, prev) != x {
            // dbg!(ok * g, prev, x, g, gcd(ok * g, prev));
            ok += 1;
        }
        res.push(ok * g);
        prev = ok * g;
        x = y;
    }
    let mut gcd_vec = vec![];
    for i in 1..res.len() {
        let g = gcd(res[i - 1], res[i]);
        gcd_vec.push(g);
    }
    // d!(gcd_vec);
    vp!(res);
    return;
}