結果

問題 No.358 も～っと！門松列
ユーザー alchemin
提出日時 2019-11-26 18:30:47
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 1 ms / 1,000 ms
コード長 2,195 bytes
コンパイル時間 14,188 ms
コンパイル使用メモリ 380,104 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-07 00:32:59
合計ジャッジ時間 15,331 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 23
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unnecessary parentheses around assigned value
  --> src/main.rs:62:26
   |
62 |     let mut contain_eq = (a == b || b == c || c == a); 
   |                          ^                          ^
   |
   = note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
   |
62 -     let mut contain_eq = (a == b || b == c || c == a); 
62 +     let mut contain_eq = a == b || b == c || c == a; 
   |

warning: unnecessary parentheses around assigned value
  --> src/main.rs:77:22
   |
77 |         contain_eq = (a_mod == b_mod || b_mod == c_mod || c_mod == a_mod);
   |                      ^                                                  ^
   |
help: remove these parentheses
   |
77 -         contain_eq = (a_mod == b_mod || b_mod == c_mod || c_mod == a_mod);
77 +         contain_eq = a_mod == b_mod || b_mod == c_mod || c_mod == a_mod;
   |

ソースコード

diff #
プレゼンテーションモードにする

macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($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, ( $($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:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}
fn main(){
    input!{
        a:i32,
        b:i32,
        c:i32,
    }
    let mut min = std::cmp::min(a, std::cmp::min(b, c));
    let mut max = std::cmp::max(a, std::cmp::max(b, c));
    let mut contain_eq = (a == b || b == c || c == a); 
    if contain_eq {
        println!("0");
        return;
    } else if b == min || b == max {
        println!("INF");
        return;
    }
    let mut ct = 0;
    for d in 1..max + 1 {
        let (a_mod, b_mod, c_mod) = (a%d, b%d, c%d);
        min = std::cmp::min(a_mod, std::cmp::min(b_mod, c_mod));
        max = std::cmp::max(a_mod, std::cmp::max(b_mod, c_mod));
        contain_eq = (a_mod == b_mod || b_mod == c_mod || c_mod == a_mod);
        if !contain_eq && (b_mod == min || b_mod == max){
            ct += 1;
        }
    }
    println!("{}", ct);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0