結果

問題 No.726 Tree Game
ユーザー qryxip
提出日時 2018-08-24 23:15:03
言語 Rust
(1.83.0 + proconio)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 3,822 bytes
コンパイル時間 12,755 ms
コンパイル使用メモリ 379,956 KB
最終ジャッジ日時 2024-11-14 20:36:36
合計ジャッジ時間 13,465 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
error[E0433]: failed to resolve: could not find `_input` in the list of imported crates
   --> src/main.rs:15:34
    |
15  |               let mut _scanned = ::_input::Scanned::new(::std::io::stdin(), 1024);
    |                                    ^^^^^^ could not find `_input` in the list of imported crates
...
99  | /     input! {
100 | |         y: u64,
101 | |         x: u64,
102 | |     }
    | |_____- in this macro invocation
    |
    = note: this error originates in the macro `input` (in Nightly builds, run with -Z macro-backtrace for more info)
help: consider importing this struct
    |
89  + use crate::_input::Scanned;
    |

For more information about this error, try `rustc --explain E0433`.
error: could not compile `main` (bin "main") due to 1 previous error

ソースコード

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

#![allow(unused_imports)]
#![cfg_attr(feature = "cargo-clippy", allow(redundant_field_names))]
#[macro_use]
mod _input {
    use std::fmt;
    use std::io::{self, Read};
    use std::str::{self, FromStr};
    macro_rules! input {
        ($($name:ident : $t:tt),*,) => {
            input!($($name: $t),*)
        };
        ($($name:ident : $t:tt),*) => {
            let mut _scanned = ::_input::Scanned::new(::std::io::stdin(), 1024);
            $(
                let $name = _read_value!(_scanned, $t);
            )*
        };
    }
    macro_rules! _read_value {
        ($scanned:expr, ($($t:tt),*)) => {
            ($(_read_value!($scanned, $t)),*)
        };
        ($scanned:expr, [$t:tt; $n:expr]) => {
            (0..$n).map(|_| _read_value!($scanned, $t)).collect::<Vec<_>>()
        };
        ($scanned:expr, _bytes) => {
            _read_value!($scanned, String).into_bytes()
        };
        ($scanned:expr, _index) => {
            _read_value!($scanned, usize) - 1
        };
        ($scanned:expr, $t:ty) => {
            $scanned.next::<$t>()
        };
    }
    #[derive(Default)]
    pub struct Scanned {
        buf: Vec<u8>,
        pos: usize,
    }
    impl Scanned {
        pub fn new<R: Read>(mut input: R, estimated: usize) -> Self {
            let mut buf = Vec::with_capacity(estimated);
            let _ = io::copy(&mut input, &mut buf).unwrap();
            if buf.last() != Some(&b'\n') {
                buf.push(b'\n'); // input may not end with '\n'
            }
            // https://doc.rust-lang.org/src/core/char/methods.rs.html#906-908
            // assert!(str::from_utf8(&buf).unwrap().bytes().all(|c| u32::from(c) <= 0x7F));
            Scanned { buf: buf, pos: 0 }
        }
        #[inline]
        pub fn next<T: FromStr>(&mut self) -> T
        where
            T::Err: fmt::Debug,
        {
            let mut start = None;
            loop {
                match (self.buf[self.pos], start.is_some()) {
                    (b' ', true) | (b'\n', true) => break,
                    (_, true) | (b' ', false) | (b'\n', false) => self.pos += 1,
                    (_, false) => start = Some(self.pos),
                }
            }
            let target = &self.buf[start.unwrap()..self.pos];
            unsafe { str::from_utf8_unchecked(target) }.parse().unwrap()
        }
    }
}
#[allow(dead_code)]
mod output {
    use std::io::{self, BufWriter, StdoutLock, Write as _Write};
    pub fn with_stdout<F: FnMut(&mut BufWriter<StdoutLock>)>(mut f: F) {
        let stdout = io::stdout();
        let mut stdout = BufWriter::new(stdout.lock());
        f(&mut stdout);
        stdout.flush().unwrap();
    }
}
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
use std::io::Write;
use std::ops::{
    Add, AddAssign, BitAnd, BitAndAssign, BitOr, BitOrAssign, BitXor, BitXorAssign, Div, DivAssign,
    Mul, MulAssign, Neg, Not, Rem, RemAssign, Sub, SubAssign,
};
use std::str::{self, FromStr};
use std::{char, cmp, f32, f64, fmt, i16, i32, i64, i8, thread, u16, u32, u64, u8};
fn main() {
    input! {
        y: u64,
        x: u64,
    }
    let s = nearest_prime(y) - y;
    let t = nearest_prime(x) - x;
    let (p, q) = (is_prime(y), is_prime(x));
    if p && q || p && (s == 1) || q && (t == 1) || (s + t) % 2 == 0 {
        println!("Second");
    } else {
        println!("First");
    }
}
fn nearest_prime(mut x: u64) -> u64 {
    if is_prime(x) {
        x += 1;
    }
    while !is_prime(x) {
        x += 1;
    }
    x
}
fn is_prime(x: u64) -> bool {
    x > 1 && {
        let mut k = 2u64;
        loop {
            if k.pow(2) > x {
                break true;
            }
            if x % k == 0 {
                break false;
            }
            k += 1;
        }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0