#569797 (Rust) No.1260 たくさんの多項式

• 問題: No.1260 たくさんの多項式
• ユーザー: koba-e964
• 提出日時: 2020-10-23 14:28:20
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 64 ms / 2,000 ms
• コード長: 3,296 bytes
• コンパイル時間: 17,040 ms
• コンパイル使用メモリ: 400,364 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-21 10:04:15
• 合計ジャッジ時間: 16,844 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	16 ms; 5,248 KB
testcase_01	AC	15 ms; 5,376 KB
testcase_02	AC	15 ms; 5,376 KB
testcase_03	AC	16 ms; 5,376 KB
testcase_04	AC	15 ms; 5,376 KB
testcase_05	AC	15 ms; 5,376 KB
testcase_06	AC	18 ms; 5,376 KB
testcase_07	AC	18 ms; 5,376 KB
testcase_08	AC	20 ms; 5,376 KB
testcase_09	AC	19 ms; 5,376 KB
testcase_10	AC	18 ms; 5,376 KB
testcase_11	AC	18 ms; 5,376 KB
testcase_12	AC	18 ms; 5,376 KB
testcase_13	AC	18 ms; 5,376 KB
testcase_14	AC	19 ms; 5,376 KB
testcase_15	AC	18 ms; 5,376 KB
testcase_16	AC	18 ms; 5,376 KB
testcase_17	AC	18 ms; 5,376 KB
testcase_18	AC	17 ms; 5,376 KB
testcase_19	AC	18 ms; 5,376 KB
testcase_20	AC	64 ms; 5,376 KB
testcase_21	AC	43 ms; 5,376 KB
testcase_22	AC	58 ms; 5,376 KB
testcase_23	AC	53 ms; 5,376 KB
testcase_24	AC	53 ms; 5,376 KB
testcase_25	AC	49 ms; 5,376 KB
testcase_26	AC	52 ms; 5,376 KB
testcase_27	AC	50 ms; 5,376 KB
testcase_28	AC	62 ms; 5,376 KB
testcase_29	AC	52 ms; 5,376 KB
testcase_30	AC	46 ms; 5,376 KB
testcase_31	AC	53 ms; 5,376 KB
testcase_32	AC	53 ms; 5,376 KB
testcase_33	AC	43 ms; 5,376 KB
testcase_34	AC	53 ms; 5,376 KB
testcase_35	AC	40 ms; 5,376 KB
testcase_36	AC	39 ms; 5,376 KB
testcase_37	AC	48 ms; 5,376 KB
testcase_38	AC	48 ms; 5,376 KB
testcase_39	AC	54 ms; 5,376 KB
testcase_40	AC	46 ms; 5,376 KB
testcase_41	AC	51 ms; 5,376 KB
testcase_42	AC	45 ms; 5,376 KB
testcase_43	AC	53 ms; 5,376 KB
testcase_44	AC	44 ms; 5,376 KB
testcase_45	AC	44 ms; 5,376 KB
testcase_46	AC	41 ms; 5,376 KB
testcase_47	AC	46 ms; 5,376 KB
testcase_48	AC	37 ms; 5,376 KB
testcase_49	AC	42 ms; 5,376 KB
testcase_50	AC	38 ms; 5,376 KB
testcase_51	AC	52 ms; 5,376 KB
testcase_52	AC	38 ms; 5,376 KB
testcase_53	AC	41 ms; 5,376 KB
testcase_54	AC	57 ms; 5,376 KB
testcase_55	AC	56 ms; 5,376 KB
testcase_56	AC	41 ms; 5,376 KB
testcase_57	AC	45 ms; 5,376 KB
testcase_58	AC	39 ms; 5,376 KB
testcase_59	AC	47 ms; 5,376 KB
testcase_60	AC	55 ms; 5,376 KB

ソースコード

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes.by_ref().map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};
    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, [graph1; $len:expr]) => {{
        let mut g = vec![vec![]; $len];
        let ab = read_value!($next, [(usize1, usize1)]);
        for (a, b) in ab {
            g[a].push(b);
            g[b].push(a);
        }
        g
    }};
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };
    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };
    ($next:expr, usize1) => (read_value!($next, usize) - 1);
    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        read_value!($next, [$t; len])
    }};
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}

#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());
}

const MOD: i64 = 1_000_000_007;

fn sum(h: i64) -> i64 {
    let h = h % MOD;
    h * (h + 1) / 2 % MOD
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (let _ = write!(out,$($format)*););
    }
    #[allow(unused)]
    macro_rules! putvec {
        ($v:expr) => {
            for i in 0..$v.len() {
                puts!("{}{}", $v[i], if i + 1 == $v.len() {"\n"} else {" "});
            }
        }
    }
    input!(n: i64);
    let mut tot: i64 = 0;
    const B: i64 = 1_000_010;
    for i in 2..min(B, n + 1) {
        let mut tmp = 0;
        let mut v = n;
        while v > 0 {
            tmp += v % i;
            v /= i;
        }
        tot = (tot + tmp) % MOD;
    }
    for q in 1..B {
        let lo = max(min(B, n + 1) - 1, n / (q + 1));
        let hi = n / q;
        if lo < hi {
            tot = (tot + (hi - lo) % MOD * ((n + q) % MOD)) % MOD;
            let dif = (sum(lo) - sum(hi) + MOD) % MOD
                * q % MOD;
            tot = (tot + dif) % MOD;
        }
    }
    puts!("{}\n", tot);
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}