結果
問題 | No.747 循環小数N桁目 Hard |
ユーザー | hatoo |
提出日時 | 2018-10-20 11:23:40 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 3,363 bytes |
コンパイル時間 | 1,399 ms |
コンパイル使用メモリ | 155,664 KB |
実行使用メモリ | 4,384 KB |
最終ジャッジ日時 | 2023-08-12 04:57:29 |
合計ジャッジ時間 | 5,828 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,376 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 1 ms
4,380 KB |
testcase_07 | AC | 1 ms
4,380 KB |
testcase_08 | AC | 1 ms
4,380 KB |
testcase_09 | AC | 1 ms
4,376 KB |
testcase_10 | AC | 1 ms
4,380 KB |
testcase_11 | AC | 1 ms
4,376 KB |
testcase_12 | AC | 1 ms
4,384 KB |
testcase_13 | AC | 1 ms
4,380 KB |
testcase_14 | AC | 1 ms
4,376 KB |
testcase_15 | AC | 1 ms
4,376 KB |
testcase_16 | AC | 1 ms
4,384 KB |
testcase_17 | AC | 1 ms
4,380 KB |
testcase_18 | AC | 1 ms
4,380 KB |
testcase_19 | AC | 1 ms
4,376 KB |
testcase_20 | AC | 1 ms
4,380 KB |
testcase_21 | AC | 1 ms
4,380 KB |
testcase_22 | AC | 1 ms
4,376 KB |
testcase_23 | AC | 1 ms
4,380 KB |
testcase_24 | AC | 1 ms
4,376 KB |
testcase_25 | AC | 1 ms
4,376 KB |
testcase_26 | AC | 1 ms
4,380 KB |
testcase_27 | AC | 1 ms
4,380 KB |
testcase_28 | AC | 1 ms
4,380 KB |
testcase_29 | AC | 1 ms
4,380 KB |
testcase_30 | AC | 1 ms
4,376 KB |
testcase_31 | AC | 1 ms
4,380 KB |
testcase_32 | AC | 1 ms
4,380 KB |
testcase_33 | AC | 2 ms
4,380 KB |
testcase_34 | AC | 1 ms
4,376 KB |
testcase_35 | AC | 1 ms
4,376 KB |
testcase_36 | AC | 1 ms
4,380 KB |
testcase_37 | AC | 1 ms
4,380 KB |
testcase_38 | AC | 1 ms
4,380 KB |
testcase_39 | AC | 2 ms
4,376 KB |
testcase_40 | AC | 2 ms
4,380 KB |
testcase_41 | AC | 2 ms
4,380 KB |
testcase_42 | AC | 2 ms
4,380 KB |
testcase_43 | AC | 2 ms
4,380 KB |
testcase_44 | AC | 2 ms
4,380 KB |
testcase_45 | AC | 2 ms
4,376 KB |
testcase_46 | AC | 2 ms
4,376 KB |
testcase_47 | AC | 2 ms
4,376 KB |
testcase_48 | AC | 1 ms
4,380 KB |
testcase_49 | AC | 1 ms
4,380 KB |
testcase_50 | AC | 2 ms
4,380 KB |
testcase_51 | AC | 1 ms
4,380 KB |
testcase_52 | AC | 2 ms
4,376 KB |
testcase_53 | AC | 3 ms
4,380 KB |
testcase_54 | AC | 3 ms
4,376 KB |
testcase_55 | AC | 3 ms
4,380 KB |
testcase_56 | AC | 3 ms
4,380 KB |
testcase_57 | AC | 1 ms
4,384 KB |
testcase_58 | AC | 3 ms
4,380 KB |
testcase_59 | AC | 2 ms
4,376 KB |
testcase_60 | AC | 3 ms
4,380 KB |
testcase_61 | AC | 2 ms
4,384 KB |
testcase_62 | AC | 3 ms
4,380 KB |
testcase_63 | AC | 2 ms
4,380 KB |
testcase_64 | AC | 1 ms
4,376 KB |
testcase_65 | AC | 1 ms
4,380 KB |
testcase_66 | AC | 2 ms
4,376 KB |
testcase_67 | AC | 2 ms
4,376 KB |
testcase_68 | AC | 2 ms
4,380 KB |
testcase_69 | AC | 2 ms
4,376 KB |
testcase_70 | AC | 1 ms
4,376 KB |
testcase_71 | AC | 1 ms
4,380 KB |
testcase_72 | AC | 2 ms
4,376 KB |
testcase_73 | AC | 2 ms
4,380 KB |
testcase_74 | AC | 2 ms
4,384 KB |
testcase_75 | AC | 2 ms
4,384 KB |
testcase_76 | AC | 2 ms
4,380 KB |
testcase_77 | AC | 1 ms
4,376 KB |
testcase_78 | AC | 2 ms
4,384 KB |
testcase_79 | AC | 1 ms
4,380 KB |
testcase_80 | AC | 2 ms
4,380 KB |
testcase_81 | AC | 2 ms
4,376 KB |
testcase_82 | AC | 2 ms
4,380 KB |
testcase_83 | AC | 1 ms
4,380 KB |
testcase_84 | AC | 2 ms
4,380 KB |
testcase_85 | AC | 2 ms
4,380 KB |
testcase_86 | AC | 2 ms
4,376 KB |
testcase_87 | AC | 2 ms
4,376 KB |
testcase_88 | AC | 2 ms
4,376 KB |
testcase_89 | AC | 2 ms
4,384 KB |
testcase_90 | AC | 1 ms
4,380 KB |
testcase_91 | AC | 2 ms
4,380 KB |
testcase_92 | AC | 2 ms
4,380 KB |
testcase_93 | AC | 2 ms
4,380 KB |
testcase_94 | AC | 3 ms
4,380 KB |
testcase_95 | AC | 3 ms
4,380 KB |
testcase_96 | AC | 3 ms
4,380 KB |
testcase_97 | AC | 3 ms
4,380 KB |
testcase_98 | AC | 3 ms
4,376 KB |
testcase_99 | AC | 3 ms
4,376 KB |
testcase_100 | AC | 3 ms
4,376 KB |
testcase_101 | AC | 2 ms
4,380 KB |
testcase_102 | AC | 2 ms
4,380 KB |
testcase_103 | AC | 3 ms
4,380 KB |
testcase_104 | AC | 2 ms
4,380 KB |
testcase_105 | AC | 3 ms
4,380 KB |
testcase_106 | AC | 2 ms
4,376 KB |
testcase_107 | AC | 2 ms
4,380 KB |
testcase_108 | AC | 2 ms
4,380 KB |
testcase_109 | AC | 2 ms
4,380 KB |
testcase_110 | AC | 2 ms
4,380 KB |
testcase_111 | AC | 3 ms
4,384 KB |
testcase_112 | AC | 2 ms
4,380 KB |
testcase_113 | AC | 3 ms
4,380 KB |
testcase_114 | AC | 2 ms
4,380 KB |
testcase_115 | AC | 2 ms
4,376 KB |
testcase_116 | AC | 3 ms
4,376 KB |
testcase_117 | AC | 2 ms
4,376 KB |
testcase_118 | AC | 3 ms
4,380 KB |
testcase_119 | AC | 3 ms
4,384 KB |
testcase_120 | AC | 3 ms
4,380 KB |
testcase_121 | AC | 3 ms
4,376 KB |
testcase_122 | AC | 2 ms
4,376 KB |
testcase_123 | AC | 2 ms
4,380 KB |
ソースコード
#[allow(unused_imports)] use std::cmp::{max, min, Ordering}; #[allow(unused_imports)] use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque}; #[allow(unused_imports)] use std::io::{stdin, stdout, BufWriter, Write}; #[allow(unused_imports)] use std::iter::FromIterator; mod util { use std::fmt::Debug; use std::io::{stdin, stdout, BufWriter, StdoutLock}; use std::str::FromStr; #[allow(dead_code)] pub fn line() -> String { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); line.trim().to_string() } #[allow(dead_code)] pub fn chars() -> Vec<char> { line().chars().collect() } #[allow(dead_code)] pub fn gets<T: FromStr>() -> Vec<T> where <T as FromStr>::Err: Debug, { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); line.split_whitespace() .map(|t| t.parse().unwrap()) .collect() } #[allow(dead_code)] pub fn with_bufwriter<F: FnOnce(BufWriter<StdoutLock>) -> ()>(f: F) { let out = stdout(); let writer = BufWriter::new(out.lock()); f(writer) } } #[allow(unused_macros)] macro_rules ! get { ( [ $ t : ty ] ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; line . split_whitespace ( ) . map ( | t | t . parse ::<$ t > ( ) . unwrap ( ) ) . collect ::< Vec < _ >> ( ) } } ; ( [ $ t : ty ] ; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( [ $ t ] ) ) . collect ::< Vec < _ >> ( ) } ; ( $ t : ty ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; line . trim ( ) . parse ::<$ t > ( ) . unwrap ( ) } } ; ( $ ( $ t : ty ) ,* ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; let mut iter = line . split_whitespace ( ) ; ( $ ( iter . next ( ) . unwrap ( ) . parse ::<$ t > ( ) . unwrap ( ) , ) * ) } } ; ( $ t : ty ; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ ( $ t : ty ) ,*; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ ( $ t ) ,* ) ) . collect ::< Vec < _ >> ( ) } ; } #[allow(unused_macros)] macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } } const BIG_STACK_SIZE: bool = true; #[allow(dead_code)] fn main() { use std::thread; if BIG_STACK_SIZE { thread::Builder::new() .stack_size(32 * 1024 * 1024) .name("solve".into()) .spawn(solve) .unwrap() .join() .unwrap(); } else { solve(); } } fn solve() { let mut n = util::chars(); let mut k = util::chars(); n.reverse(); k.reverse(); let mut base = 1; let mut m = 0; for x in n { let x = x as u64 - '0' as u64; m += base * x; m %= 6; base *= 10; base %= 6; } let mut base = m; let mut ans = 1; for x in k { let x = x as u64 - '0' as u64; ans *= base.pow(x as u32); ans %= 6; base = base.pow(10); base %= 6; } ans = (ans + 5) % 6; println!("{}", [2, 8, 5, 7, 1, 4][ans as usize]); }