#1010088 (Rust) No.2891 Mint

• 問題: No.2891 Mint
• ユーザー: Moss_Local
• 提出日時: 2024-09-13 22:08:07
• 言語: Rust (1.77.0)
• 結果: AC
• 実行時間: 35 ms / 2,000 ms
• コード長: 4,906 bytes
• コンパイル時間: 14,979 ms
• コンパイル使用メモリ: 399,612 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-13 22:08:25
• 合計ジャッジ時間: 16,751 ms
• ジャッジサーバーID （参考情報）: judge6 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	22 ms; 5,376 KB
testcase_05	AC	1 ms; 5,376 KB
testcase_06	AC	35 ms; 5,376 KB
testcase_07	AC	1 ms; 5,376 KB
testcase_08	AC	1 ms; 5,376 KB
testcase_09	AC	1 ms; 5,376 KB
testcase_10	AC	1 ms; 5,376 KB
testcase_11	AC	0 ms; 5,376 KB
testcase_12	AC	1 ms; 5,376 KB
testcase_13	AC	1 ms; 5,376 KB
testcase_14	AC	1 ms; 5,376 KB
testcase_15	AC	1 ms; 5,376 KB
testcase_16	AC	1 ms; 5,376 KB
testcase_17	AC	25 ms; 5,376 KB
testcase_18	AC	15 ms; 5,376 KB
testcase_19	AC	13 ms; 5,376 KB
testcase_20	AC	22 ms; 5,376 KB
testcase_21	AC	13 ms; 5,376 KB
testcase_22	AC	28 ms; 5,376 KB
testcase_23	AC	11 ms; 5,376 KB
testcase_24	AC	22 ms; 5,376 KB
testcase_25	AC	31 ms; 5,376 KB
testcase_26	AC	30 ms; 5,376 KB
testcase_27	AC	29 ms; 5,376 KB
testcase_28	AC	32 ms; 5,376 KB
testcase_29	AC	14 ms; 5,376 KB
testcase_30	AC	23 ms; 5,376 KB
testcase_31	AC	15 ms; 5,376 KB
testcase_32	AC	26 ms; 5,376 KB
testcase_33	AC	19 ms; 5,376 KB
testcase_34	AC	20 ms; 5,376 KB
testcase_35	AC	23 ms; 5,376 KB
testcase_36	AC	25 ms; 5,376 KB
testcase_37	AC	17 ms; 5,376 KB
testcase_38	AC	16 ms; 5,376 KB
testcase_39	AC	20 ms; 5,376 KB
testcase_40	AC	21 ms; 5,376 KB
testcase_41	AC	13 ms; 5,376 KB
testcase_42	AC	1 ms; 5,376 KB
testcase_43	AC	1 ms; 5,376 KB
testcase_44	AC	1 ms; 5,376 KB
testcase_45	AC	1 ms; 5,376 KB
testcase_46	AC	1 ms; 5,376 KB
testcase_47	AC	19 ms; 5,376 KB
testcase_48	AC	19 ms; 5,376 KB
testcase_49	AC	22 ms; 5,376 KB
testcase_50	AC	7 ms; 5,376 KB
testcase_51	AC	16 ms; 5,376 KB
testcase_52	AC	6 ms; 5,376 KB
testcase_53	AC	13 ms; 5,376 KB
testcase_54	AC	15 ms; 5,376 KB
testcase_55	AC	4 ms; 5,376 KB
testcase_56	AC	22 ms; 5,376 KB

コンパイルメッセージ

warning: variable does not need to be mutable
   --> src/main.rs:117:9
    |
117 |     let mut vec: Vec<i64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`
    |
    = note: `#[warn(unused_mut)]` on by default

warning: variable does not need to be mutable
   --> src/main.rs:123:9
    |
123 |     let mut vec: Vec<i64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:128:9
    |
128 |     let mut vec: Vec<usize> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:134:9
    |
134 |     let mut vec: Vec<f64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:139:9
    |
139 |     let mut vec: Vec<char> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:144:9
    |
144 |     let mut vec: Vec<usize> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:149:9
    |
149 |     let mut vec: Vec<i64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:155:9
    |
155 |     let mut vec: Vec<usize> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable `N` should have a snake case name
   --> src/main.rs:188:9
    |
188 |     let N = n as u64;
    |         ^ help: convert the identifier to snake case: `n`
    |
    = note: `#[warn(non_snake_case)]` on by default

warning: variable `M` should have a snake case name
   --> src/main.rs:189:9
    |
189 |     let M = m as

ソースコード

// -*- 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 = 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
        }
    };
}

//input output
#[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 vec: Vec<i64> = read_vec();
    (vec[0], vec[1])
}

#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1])
}

#[allow(dead_code)]
fn readff() -> (f64, f64) {
    let mut vec: Vec<f64> = read_vec();
    (vec[0], vec[1])
}

fn readcc() -> (char, char) {
    let mut vec: Vec<char> = read_vec();
    (vec[0], vec[1])
}

fn readuuu() -> (usize, usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readiiii() -> (i64, i64, i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1], vec[2], vec[3])
}

#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1], vec[2], vec[3])
}
use std::io::BufRead;

const MOD: u64 = 998244353;

fn floor_sqrt(n: u64) -> u64 {
    if n == 0 || n == 1 {
        return n;
    }
    let mut left = 0;
    let mut right = n;
    let mut ans = 0;
    while left <= right {
        let mid = left + (right - left) / 2;
        if mid > 0 && mid > n / mid {
            // Prevent overflow
            right = mid - 1;
        } else {
            if mid * mid <= n {
                ans = mid;
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }
    }
    ans
}

fn main() {
    let (n, m) = readuu();
    let N = n as u64;
    let M = m as u64;
    let K_limit = floor_sqrt(M);
    let k_max = if K_limit < N { K_limit } else { N };
    let mut sum_k_floor_Mk: u128 = 0;
    //愚直＋主客転倒
    for k in 1..=k_max {
        let q = M / k;
        sum_k_floor_Mk += (k as u128) * (q as u128);
    }

    let q_max = if K_limit + 1 > 0 {
        M / (K_limit + 1)
    } else {
        0
    };
    for q in 1..=q_max {
        let mut l = (M / (q + 1)) + 1;
        let mut r = M / q;
        if l < K_limit + 1 {
            l = K_limit + 1;
        }
        if r > N {
            r = N;
        }
        if l > r {
            continue;
        }
        let count = r - l + 1;
        let sum_k = ((l as u128) + (r as u128)) * (count as u128) / 2;
        sum_k_floor_Mk += (q as u128) * sum_k;
    }

    let total = (M as u128) * (N as u128);
    let sum = total.wrapping_sub(sum_k_floor_Mk);
    let result = (sum % (MOD as u128)) as u64;

    println!("{}", result);
}