結果
問題 | No.747 循環小数N桁目 Hard |
ユーザー | McGregorsh |
提出日時 | 2022-11-10 13:44:07 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 1,498 bytes |
コンパイル時間 | 416 ms |
コンパイル使用メモリ | 82,580 KB |
実行使用メモリ | 91,952 KB |
最終ジャッジ日時 | 2024-04-20 10:01:07 |
合計ジャッジ時間 | 21,653 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 144 ms
89,360 KB |
testcase_01 | AC | 139 ms
89,516 KB |
testcase_02 | AC | 140 ms
89,608 KB |
testcase_03 | AC | 141 ms
89,616 KB |
testcase_04 | AC | 140 ms
89,684 KB |
testcase_05 | AC | 141 ms
89,480 KB |
testcase_06 | AC | 142 ms
89,564 KB |
testcase_07 | AC | 140 ms
89,548 KB |
testcase_08 | AC | 138 ms
89,392 KB |
testcase_09 | AC | 140 ms
89,716 KB |
testcase_10 | AC | 137 ms
89,148 KB |
testcase_11 | AC | 140 ms
89,548 KB |
testcase_12 | AC | 143 ms
89,176 KB |
testcase_13 | AC | 144 ms
89,408 KB |
testcase_14 | AC | 142 ms
89,636 KB |
testcase_15 | AC | 149 ms
89,856 KB |
testcase_16 | AC | 152 ms
89,584 KB |
testcase_17 | AC | 146 ms
89,584 KB |
testcase_18 | AC | 140 ms
89,496 KB |
testcase_19 | AC | 143 ms
89,664 KB |
testcase_20 | AC | 139 ms
89,384 KB |
testcase_21 | AC | 142 ms
89,628 KB |
testcase_22 | AC | 140 ms
89,656 KB |
testcase_23 | AC | 139 ms
89,276 KB |
testcase_24 | AC | 143 ms
89,520 KB |
testcase_25 | AC | 143 ms
89,640 KB |
testcase_26 | AC | 143 ms
89,620 KB |
testcase_27 | AC | 142 ms
89,652 KB |
testcase_28 | AC | 141 ms
89,392 KB |
testcase_29 | AC | 142 ms
89,544 KB |
testcase_30 | AC | 145 ms
89,668 KB |
testcase_31 | AC | 145 ms
89,580 KB |
testcase_32 | AC | 140 ms
89,332 KB |
testcase_33 | RE | - |
testcase_34 | RE | - |
testcase_35 | RE | - |
testcase_36 | RE | - |
testcase_37 | RE | - |
testcase_38 | RE | - |
testcase_39 | RE | - |
testcase_40 | RE | - |
testcase_41 | RE | - |
testcase_42 | RE | - |
testcase_43 | RE | - |
testcase_44 | RE | - |
testcase_45 | RE | - |
testcase_46 | RE | - |
testcase_47 | RE | - |
testcase_48 | RE | - |
testcase_49 | RE | - |
testcase_50 | RE | - |
testcase_51 | RE | - |
testcase_52 | RE | - |
testcase_53 | RE | - |
testcase_54 | RE | - |
testcase_55 | RE | - |
testcase_56 | RE | - |
testcase_57 | RE | - |
testcase_58 | RE | - |
testcase_59 | RE | - |
testcase_60 | RE | - |
testcase_61 | RE | - |
testcase_62 | RE | - |
testcase_63 | RE | - |
testcase_64 | RE | - |
testcase_65 | RE | - |
testcase_66 | RE | - |
testcase_67 | RE | - |
testcase_68 | RE | - |
testcase_69 | RE | - |
testcase_70 | RE | - |
testcase_71 | RE | - |
testcase_72 | RE | - |
testcase_73 | RE | - |
testcase_74 | RE | - |
testcase_75 | RE | - |
testcase_76 | RE | - |
testcase_77 | RE | - |
testcase_78 | RE | - |
testcase_79 | RE | - |
testcase_80 | RE | - |
testcase_81 | RE | - |
testcase_82 | RE | - |
testcase_83 | RE | - |
testcase_84 | RE | - |
testcase_85 | RE | - |
testcase_86 | RE | - |
testcase_87 | RE | - |
testcase_88 | RE | - |
testcase_89 | RE | - |
testcase_90 | RE | - |
testcase_91 | RE | - |
testcase_92 | RE | - |
testcase_93 | RE | - |
testcase_94 | RE | - |
testcase_95 | RE | - |
testcase_96 | RE | - |
testcase_97 | RE | - |
testcase_98 | RE | - |
testcase_99 | RE | - |
testcase_100 | RE | - |
testcase_101 | RE | - |
testcase_102 | RE | - |
testcase_103 | RE | - |
testcase_104 | RE | - |
testcase_105 | RE | - |
testcase_106 | RE | - |
testcase_107 | RE | - |
testcase_108 | RE | - |
testcase_109 | RE | - |
testcase_110 | RE | - |
testcase_111 | RE | - |
testcase_112 | RE | - |
testcase_113 | RE | - |
testcase_114 | RE | - |
testcase_115 | RE | - |
testcase_116 | RE | - |
testcase_117 | RE | - |
testcase_118 | RE | - |
testcase_119 | RE | - |
testcase_120 | RE | - |
testcase_121 | RE | - |
testcase_122 | RE | - |
testcase_123 | RE | - |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 ###関数コピーしたか?### def main(): N = int(input()) K = int(input()) nums = [2, 8, 5, 7, 1, 4] point = pow(N, K, 6) print(nums[point-1]) if __name__ == '__main__': main()