結果

問題 No.327 アルファベット列
ユーザー MasuqaT
提出日時 2019-05-05 16:15:51
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 1 ms / 2,000 ms
コード長 3,920 bytes
コンパイル時間 12,629 ms
コンパイル使用メモリ 379,604 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-06-25 02:57:40
合計ジャッジ時間 14,407 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 50
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused `Result` that must be used
   --> src/main.rs:133:5
    |
133 |     write!(writer, "{}", chars.iter().rev().collect::<String>());
    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
    |
    = 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 #
プレゼンテーションモードにする

use std::io;
use std::io::{BufRead, Write};
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!($expected, output);
}
};
}
#[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)
}
}
}
});
}
fn main() {
let stdio = io::stdin();
let input = stdio.lock();
let output = io::stdout();
process(input, output);
}
// ? [#26^1] (= 0 ~ 26^1 - 1
// ?? [#26^2] (= 26^1 ~ 26^2 + 26^1 - 1
// ??? [#26^3] (= 26^2 + 26^1 ~ 26^3 + 26^2 + 26^1 - 1
fn process<R, W>(mut reader: R, mut writer: W) -> () where
R: BufRead,
W: Write {
input! {
stdin = reader,
n: u64
}
let mut rest = n;
let mut chars = Vec::new();
loop {
let c = (rest % 26) as u8;
chars.push((c + 'A' as u8) as char);
if rest < 26 {
break;
}
rest = rest / 26 - 1;
}
write!(writer, "{}", chars.iter().rev().collect::<String>());
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn sample1() {
assert_judge!(process, "0", "A\
");
}
#[test]
fn sample2() {
assert_judge!(process, "25", "Z\
");
}
#[test]
fn sample3() {
assert_judge!(process, "26", "AA\
");
}
#[test]
fn extra1() {
assert_judge!(process, "1", "B\
");
}
#[test]
fn gen_case16() {
assert_judge!(process, "5000000000", "PDULURI\
");
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0