結果

問題 No.2385 Parse Integer with Radix
ユーザー haihamabossu
提出日時 2023-07-21 22:53:07
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 1 ms / 2,000 ms
コード長 1,946 bytes
コンパイル時間 14,504 ms
コンパイル使用メモリ 383,448 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-09-22 00:26:14
合計ジャッジ時間 14,033 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 11
権限があれば一括ダウンロードができます

ソースコード

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

pub mod scanner {
    pub struct Scanner {
        buf: Vec<String>,
    }
    impl Scanner {
        pub fn new() -> Self {
            Self { buf: vec![] }
        }
        pub fn new_from(source: &str) -> Self {
            let source = String::from(source);
            let buf = Self::split(source);
            Self { buf }
        }
        pub fn next<T: std::str::FromStr>(&mut self) -> T {
            loop {
                if let Some(x) = self.buf.pop() {
                    return x.parse().ok().expect("");
                }
                let mut source = String::new();
                std::io::stdin().read_line(&mut source).expect("");
                self.buf = Self::split(source);
            }
        }
        fn split(source: String) -> Vec<String> {
            source
                .split_whitespace()
                .rev()
                .map(String::from)
                .collect::<Vec<_>>()
        }
    }
}
use crate::scanner::Scanner;
use std::io::Write;
fn main() {
    let mut scanner = Scanner::new();
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    let t: usize = scanner.next();
    for _ in 0..t {
        solve(&mut scanner, &mut out);
    }
}
fn solve(scanner: &mut Scanner, out: &mut std::io::BufWriter<std::io::StdoutLock>) {
    let s: Vec<char> = scanner.next::<String>().chars().map(|c| c).collect();
    let (b, a) = if s.len() == 1 || s[0] != '0' {
        (10, 0)
    } else {
        match s[0..2] {
            ['0', 'b'] => (2, 2),
            ['0', 'o'] => (8, 2),
            ['0', 'x'] => (16, 2),
            _ => (10, 0),
        }
    };
    let mut ans: usize = 0;
    for &val in s[a..].iter() {
        ans *= b;
        if '0' <= val && val <= '9' {
            ans += val as usize - '0' as usize;
        } else {
            ans += val as usize - 'a' as usize + 10;
        }
    }
    writeln!(out, "{}", ans).unwrap();
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0