結果

問題 No.7 プライムナンバーゲーム
コンテスト
ユーザー MasuqaT
提出日時 2019-08-12 13:58:30
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 37 ms / 5,000 ms
コード長 6,729 bytes
コンパイル時間 23,135 ms
コンパイル使用メモリ 379,500 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-10-01 16:24:23
合計ジャッジ時間 14,825 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 17
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused `Result` that must be used
   --> src/main.rs:239:5
    |
239 |     write!(writer, "{}", if losing_numbers.contains(&n) { "Lose" } else { "Win" });
    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
    |
    = note: this `Result` may be an `Err` variant, which should be handled
    = note: `#[warn(unused_must_use)]` on by default
    = note: this warning originates in the macro `write` (in Nightly builds, run with -Z macro-backtrace for more info)

ソースコード

diff # 

// Macro by MasuqaT (occar421)
// https://github.com/occar421/ProgrammingContest/tree/master/templates/src/standard_io.rs

use std::io;
use std::io::{BufRead, Write};
use std::ops::{Rem, Div, Mul};
use std::fmt::Display;
use std::collections::HashSet;

// From https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    (stdin = $s:expr, $($r:tt)*) => {
        let s = {
            let mut s = String::new();
            $s.read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

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

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };

    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_macros)]
macro_rules! assert_judge {
    ($method:ident, $input:expr, $expected:expr) => {
        {
            let input = $input.as_bytes();
            let mut output = Vec::new();

            $method(&input[..], &mut output);

            let output = String::from_utf8(output).expect("Not UTF-8");

            assert_eq!(output, $expected);
        }
    };
}

#[allow(unused_macros)]
macro_rules! assert_judge_with_output {
    ($method:ident, $input:expr) => {
        {
            let input = $input.as_bytes();
            let mut output = Vec::new();

            $method(&input[..], &mut output);

            String::from_utf8(output).expect("Not UTF-8")
        }
    };
}

#[allow(unused_macros)]
macro_rules! assert_eq_with_error {
    ($left:expr, $right:expr, $precision:expr) => ({
        match (&$left, &$right, &$precision) {
            (left_val, right_val, precision_val) => {
                if !(*left_val - *precision_val < *right_val && *right_val < *left_val + *precision_val) {
                    // The reborrows below are intentional. Without them, the stack slot for the
                    // borrow is initialized even before the values are compared, leading to a
                    // noticeable slow down.
                    panic!(r#"assertion failed: `(left == right) +- precision`
      left: `{:?}`,
     right: `{:?}`,
 precision: `{:?}`"#, &*left_val, &*right_val, &*precision_val)
                }
            }
        }
    });
}

#[allow(unused_macros)]
macro_rules! assert_judge_with_error {
    ($method:ident, $input:expr, $expected:expr, $t:ty | $precision:expr ) => {
        {
            let input = $input.as_bytes();
            let mut output = Vec::new();

            $method(&input[..], &mut output);

            let output = String::from_utf8(output).expect("Not UTF-8");

            let actual: $t = output.parse().unwrap();
            let expected: $t = $expected.parse().unwrap();

            assert_eq_with_error!(actual, expected, $precision);
        }
    };
}

pub trait GenericInteger: Copy + PartialEq + Rem<Output=Self> + Div<Output=Self> + Mul<Output=Self> {
    fn zero() -> Self;
}

macro_rules! dec_gi {
    () => {};
    ($t:ty $(, $r:ty)*) => {
        impl GenericInteger for $t {
            #[inline]
            fn zero() -> Self { 0 }
        }

        dec_gi![ $( $r ),* ];
    };
}

dec_gi![u8, u16, u32, u64, u128, usize, i8, i16, i32, i64, i128, isize];

#[allow(dead_code)]
pub fn gcd<T>(a: T, b: T) -> T where T: GenericInteger {
    if b == T::zero() {
        a
    } else {
        gcd(b, a % b)
    }
}

#[allow(dead_code)]
#[inline]
pub fn lcm<T>(a: T, b: T) -> T where T: GenericInteger {
    a / gcd(a, b) * b
}

pub trait IterExt<T> where T: Display {
    fn easy_join(&mut self, separator: &str) -> String;
}

impl<TItem, TTrait> IterExt<TItem> for TTrait where TItem: Display, TTrait: Iterator<Item=TItem> {
    #[inline]
    fn easy_join(&mut self, separator: &str) -> String {
        self.map(|i| format!("{}", i)).collect::<Vec<_>>().join(separator)
    }
}

fn main() {
    let stdio = io::stdin();
    let input = stdio.lock();

    let output = io::stdout();

    process(input, output);
}

fn process<R, W>(mut reader: R, mut writer: W) -> () where
    R: BufRead,
    W: Write {
    input! {
        stdin = reader,
        n: usize
    }

    let primes = {
        let mut result = HashSet::new();
        let mut table = vec![true; n + 1];
        table[0] = false;
        table[1] = false;
        for i in 2..=n {
            if table[i] {
                result.insert(i);
                let mut j = 2;
                while i * j <= n {
                    table[i * j] = false;
                    j += 1;
                }
            }
        }
        result
    };

    //  2 => "Lose", //  2 --(2)-> 0W
    //  3 => "Lose", //  3 --(2)-> 1W
    //  4 => "Win",  //  4 --(2)-> 2L
    //  5 => "Win",  //  5 --(3)-> 2L
    //  6 => "Win",  //  6 --(3)-> 3L
    //  7 => "Win",  //  7 --(5)-> 2L
    //  8 => "Win",  //  8 --(5)-> 3L
    //  9 => "Win",  //  9 --(7)-> 2L
    // 10 => "Win",  // 10 --(7)-> 3L
    // 11 => "Lose", // 11 --(?)-> ?W
    // 12 => "Lose", // 12 --(?)-> ?W
    // 13 => "Win",  // 13 --(2)-> 11L
    // 14 => "Win",  // 14 --(3)-> 11L
    // 15 => "Win",  // 15 --(3)-> 12L
    // 16 => "Win",  // 16 --(5)-> 11L
    // 17 => "Win",  // 17 --(5)-> 12L
    // 18 => "Win",  // 18 --(7)-> 11L
    // 19 => "Win",  // 19 --(7)-> 12L
    // 20 => "Win",  // 20 -(17)-> 3L
    // 21 => "Win",  // 21 -(19)-> 2L
    let mut losing_numbers = HashSet::new();
    losing_numbers.insert(2);
    losing_numbers.insert(3);
    'outer: for i in 4..=n {
        for losing_number in losing_numbers.iter() {
            let diff = i - *losing_number;
            if primes.contains(&diff) {
                continue 'outer; // can win
            }
        }
        losing_numbers.insert(i); // can't win
    }

    write!(writer, "{}", if losing_numbers.contains(&n) { "Lose" } else { "Win" });
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn sample1() {
        assert_judge!(process, "5", "Win");
    }

    #[test]
    fn sample2() {
        assert_judge!(process, "12", "Lose");
    }
}
0