結果

問題 No.1926 Sequence of Remainders
ユーザー Moss_LocalMoss_Local
提出日時 2022-05-10 20:18:07
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 164 ms / 2,000 ms
コード長 5,087 bytes
コンパイル時間 12,518 ms
コンパイル使用メモリ 399,212 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-07-18 03:09:50
合計ジャッジ時間 20,632 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 0 ms
6,812 KB
testcase_01 AC 128 ms
6,940 KB
testcase_02 AC 125 ms
6,940 KB
testcase_03 AC 128 ms
6,940 KB
testcase_04 AC 128 ms
6,944 KB
testcase_05 AC 127 ms
6,944 KB
testcase_06 AC 135 ms
6,940 KB
testcase_07 AC 134 ms
6,940 KB
testcase_08 AC 137 ms
6,944 KB
testcase_09 AC 140 ms
6,940 KB
testcase_10 AC 136 ms
6,940 KB
testcase_11 AC 135 ms
6,944 KB
testcase_12 AC 164 ms
6,940 KB
testcase_13 AC 131 ms
6,944 KB
testcase_14 AC 134 ms
6,944 KB
testcase_15 AC 136 ms
6,944 KB
testcase_16 AC 133 ms
6,940 KB
testcase_17 AC 134 ms
6,940 KB
testcase_18 AC 138 ms
6,940 KB
testcase_19 AC 135 ms
6,944 KB
testcase_20 AC 132 ms
6,944 KB
testcase_21 AC 135 ms
6,944 KB
testcase_22 AC 135 ms
6,940 KB
testcase_23 AC 135 ms
6,944 KB
testcase_24 AC 138 ms
6,944 KB
testcase_25 AC 141 ms
6,940 KB
testcase_26 AC 134 ms
6,944 KB
testcase_27 AC 136 ms
6,940 KB
testcase_28 AC 136 ms
6,940 KB
testcase_29 AC 136 ms
6,940 KB
testcase_30 AC 147 ms
6,944 KB
testcase_31 AC 137 ms
6,944 KB
testcase_32 AC 136 ms
6,944 KB
testcase_33 AC 138 ms
6,940 KB
testcase_34 AC 138 ms
6,948 KB
testcase_35 AC 141 ms
6,940 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unnecessary parentheses around type
  --> src/main.rs:73:15
   |
73 | fn readi() -> (i64) {
   |               ^   ^
   |
   = note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
   |
73 - fn readi() -> (i64) {
73 + fn readi() -> i64 {
   |

warning: unnecessary parentheses around function argument
   --> src/main.rs:184:23
    |
184 |     let last = max(1, (m as i64 - n as i64));
    |                       ^                   ^
    |
help: remove these parentheses
    |
184 -     let last = max(1, (m as i64 - n as i64));
184 +     let last = max(1, m as i64 - n as i64);
    |

warning: unused variable: `i`
   --> src/main.rs:193:9
    |
193 |     for i in 0..n {
    |         ^ help: if this is intentional, prefix it with an underscore: `_i`
    |
    = note: `#[warn(unused_variables)]` on by default

ソースコード

diff #

// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
use std::any::Any;
use std::cmp::Ordering::*;
use std::collections::*;
use std::convert::*;
use std::convert::{From, Into};
use std::error::Error;
use std::f64::consts::PI;
use std::fmt::Debug;
use std::fmt::Display;
use std::fs::File;
use std::hash::Hash;
use std::io::prelude::*;
use std::io::*;
use std::iter::Filter;
use std::marker::Copy;
use std::mem::*;
use std::ops::Bound::*;
use std::ops::RangeBounds;
use std::ops::{Add, Mul, Neg, Sub};
use std::process;
use std::slice::from_raw_parts;
use std::str;
use std::vec;

const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
// const FINF: f64 = 122337203685.0;
const LINF: i64 = 2147483647;
const FINF: f64 = LINF as f64;
const INF128: i128 = 1223372036854775807000000000000;
const MOD: i64 = 1000000007;
// const MOD: i64 = 998244353;
const UMOD: usize = MOD as usize;

const MPI: f64 = 3.14159265358979323846264338327950288f64;
// const MOD: i64 = INF;

use std::cmp::*;
use std::collections::*;
use std::io::stdin;
use std::io::stdout;
use std::io::Write;

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

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 readi() -> (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()
}

#[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(),
    )
}

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(),
    )
}

#[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(),
    )
}

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(),
    )
}

fn solve_part() {
    let (n, m, k) = readuuu();
    let mut a0 = k % m;
    let last = max(1, (m as i64 - n as i64));
    if a0 >= last as usize {
        a0 = 0;
    }
    p!(a0 % last as usize);
    return;
}
fn solve() {
    let n: usize = read();
    for i in 0..n {
        solve_part();
    }
    return;
}
0