結果
問題 | No.167 N^M mod 10 |
ユーザー | McGregorsh |
提出日時 | 2023-05-14 23:00:24 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 1,415 bytes |
コンパイル時間 | 298 ms |
コンパイル使用メモリ | 87,216 KB |
実行使用メモリ | 92,760 KB |
最終ジャッジ日時 | 2023-08-20 08:08:20 |
合計ジャッジ時間 | 8,954 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 232 ms
92,164 KB |
testcase_01 | AC | 236 ms
91,960 KB |
testcase_02 | RE | - |
testcase_03 | RE | - |
testcase_04 | RE | - |
testcase_05 | AC | 239 ms
92,092 KB |
testcase_06 | AC | 234 ms
92,068 KB |
testcase_07 | AC | 236 ms
92,060 KB |
testcase_08 | AC | 238 ms
92,132 KB |
testcase_09 | AC | 241 ms
91,980 KB |
testcase_10 | AC | 236 ms
92,040 KB |
testcase_11 | AC | 237 ms
91,884 KB |
testcase_12 | AC | 236 ms
92,256 KB |
testcase_13 | AC | 233 ms
92,380 KB |
testcase_14 | AC | 234 ms
92,212 KB |
testcase_15 | AC | 235 ms
91,892 KB |
testcase_16 | AC | 236 ms
92,172 KB |
testcase_17 | AC | 236 ms
92,244 KB |
testcase_18 | AC | 239 ms
92,024 KB |
testcase_19 | AC | 239 ms
92,164 KB |
testcase_20 | AC | 239 ms
92,100 KB |
testcase_21 | AC | 236 ms
92,028 KB |
testcase_22 | RE | - |
testcase_23 | RE | - |
testcase_24 | RE | - |
testcase_25 | RE | - |
testcase_26 | RE | - |
testcase_27 | RE | - |
testcase_28 | 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()) M = int(input()) print(pow(N, M, 10)) if __name__ == '__main__': main()