結果

問題 No.1926 Sequence of Remainders
ユーザー kenichikenichi
提出日時 2023-08-16 16:45:44
言語 Rust
(1.77.0 + proconio)
結果
TLE  
実行時間 -
コード長 5,002 bytes
コンパイル時間 11,410 ms
コンパイル使用メモリ 379,320 KB
実行使用メモリ 10,752 KB
最終ジャッジ日時 2024-05-04 00:36:20
合計ジャッジ時間 18,066 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 514 ms
10,752 KB
testcase_01 AC 160 ms
5,248 KB
testcase_02 AC 160 ms
5,376 KB
testcase_03 AC 162 ms
5,376 KB
testcase_04 AC 164 ms
5,376 KB
testcase_05 AC 186 ms
5,376 KB
testcase_06 TLE -
testcase_07 -- -
testcase_08 -- -
testcase_09 -- -
testcase_10 -- -
testcase_11 -- -
testcase_12 -- -
testcase_13 -- -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
testcase_31 -- -
testcase_32 -- -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

use std::io::*;
use std::str::FromStr;
/*
const LOW_CASE_ALPHABET: [char; 26] = [
    'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's',
    't', 'u', 'v', 'w', 'x', 'y', 'z',
];
*/

fn main() {
    let t: usize = read();

    for _i in 0..t{
        let n: usize = read();
        let m: usize = read();
        let k: usize = read();

        println!("{}",correct(n, m, k));
    }
}

pub fn correct(tmp_1: usize, tmp_2: usize, tmp_3: usize) -> usize{
    let mut ans = 0;
    for _j in 0..=tmp_1{
        if _j == 0{
            ans = tmp_3 % tmp_2;
        }else{
            ans %= tmp_2 - _j;
        }
        if ans == 0{
            break;
        }
    }

    ans
}

pub fn ctoi(c: char) -> isize {
    let n = c as isize - '0' as isize;

    return n;
}

pub fn stoi(c: String) -> isize {
    let n = c.parse::<isize>().unwrap();

    return n;
}

pub fn find_char(sentence: Vec<char>, target: char, start: isize) -> isize {
    for _i in start as usize..sentence.len() {
        if sentence[_i] == target {
            return _i as isize;
        }
    }
    return -1;
}

pub fn hex_to_binary_2(hex_string: String, x: u32) -> Option<String> {
    match i64::from_str_radix(&hex_string, x) {
        Ok(decimal) => Some(format!("{}", decimal)),
        Err(_) => None,
    }
}

pub fn hex_to_binary(hex_string: &str, x: u32) -> Option<String> {
    match i64::from_str_radix(hex_string, x) {
        Ok(decimal) => Some(format!("{}", decimal)),
        Err(_) => None,
    }
}

pub fn my_floor(x: f64) -> f64 {
    let rounded = (x * 1000.0).floor() / 1000.0;

    rounded
}

pub fn upper_lower(x: char) -> char {
    let result: char;

    if x.is_uppercase() {
        result = x.to_ascii_lowercase();
    } else if x.is_lowercase() {
        result = x.to_ascii_uppercase();
    } else {
        result = x;
    }

    result
}

pub fn maxf_2(x: f64, y: f64) -> f64 {
    let result;

    if x >= y {
        result = x;
    } else {
        result = y;
    }

    result
}

pub fn max_2(x: isize, y: isize) -> isize {
    let result;

    if x >= y {
        result = x;
    } else {
        result = y;
    }

    result
}

pub fn max_u_2(x: usize, y: usize) -> usize {
    let result;

    if x >= y {
        result = x;
    } else {
        result = y;
    }

    result
}

pub fn min_u_2(x: usize, y: usize) -> usize {
    let result;

    if x <= y {
        result = x;
    } else {
        result = y;
    }

    result
}

pub fn min_2(x: isize, y: isize) -> isize {
    let result;

    if x >= y {
        result = y;
    } else {
        result = x;
    }

    result
}

pub fn min_2_i32(x: i32, y: i32) -> i32 {
    let result;

    if x >= y {
        result = y;
    } else {
        result = x;
    }

    result
}

pub fn max_3(x: isize, y: isize, z: isize) -> isize {
    let result;
    if x >= y && y >= z {
        result = x;
    } else if x >= z && z >= y {
        result = x;
    } else if y >= x && x >= z {
        result = y;
    } else if y >= z && z >= x {
        result = y;
    } else if z >= x && x >= y {
        result = z;
    } else {
        result = z;
    }

    result
}

pub fn max_u_3(x: usize, y: usize, z: usize) -> usize {
    let result;
    if x >= y && y >= z {
        result = x;
    } else if x >= z && z >= y {
        result = x;
    } else if y >= x && x >= z {
        result = y;
    } else if y >= z && z >= x {
        result = y;
    } else if z >= x && x >= y {
        result = z;
    } else {
        result = z;
    }

    result
}

pub fn min_3(x: isize, y: isize, z: isize) -> isize {
    let result;
    if x <= y && y <= z {
        result = x;
    } else if x <= z && z <= y {
        result = x;
    } else if y <= x && x <= z {
        result = y;
    } else if y <= z && z <= x {
        result = y;
    } else if z <= x && x <= y {
        result = z;
    } else {
        result = z;
    }

    result
}

pub fn min_u_3(x: usize, y: usize, z: usize) -> usize {
    let result;
    if x <= y && y <= z {
        result = x;
    } else if x <= z && z <= y {
        result = x;
    } else if y <= x && x <= z {
        result = y;
    } else if y <= z && z <= x {
        result = y;
    } else if z <= x && x <= y {
        result = z;
    } else {
        result = z;
    }

    result
}

pub fn read_text() -> String {
    let mut word = String::new();
    std::io::stdin().read_line(&mut word).ok();
    let answer = word.trim().to_string();

    answer
}

pub fn read_array() -> Vec<char> {
    let array: String = read();
    let chars: Vec<char> = array.trim().chars().collect::<Vec<char>>();
    chars
}

pub fn read<T: FromStr>() -> T {
    let stdin = stdin();
    let stdin = stdin.lock();
    let token: String = stdin
        .bytes()
        .map(|c| c.expect("failed to read char") as char)
        .skip_while(|c| c.is_whitespace())
        .take_while(|c| !c.is_whitespace())
        .collect();
    token.parse().ok().expect("failed to parse token")
}
0