結果
問題 | No.976 2 の 128 乗と M |
ユーザー | McGregorsh |
提出日時 | 2023-04-14 11:49:28 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 156 ms / 2,000 ms |
コード長 | 1,451 bytes |
コンパイル時間 | 312 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 89,884 KB |
最終ジャッジ日時 | 2024-04-18 11:12:01 |
合計ジャッジ時間 | 9,176 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 134 ms
89,600 KB |
testcase_01 | AC | 134 ms
89,600 KB |
testcase_02 | AC | 130 ms
89,600 KB |
testcase_03 | AC | 144 ms
89,540 KB |
testcase_04 | AC | 131 ms
89,396 KB |
testcase_05 | AC | 128 ms
89,088 KB |
testcase_06 | AC | 134 ms
89,600 KB |
testcase_07 | AC | 139 ms
89,884 KB |
testcase_08 | AC | 139 ms
89,540 KB |
testcase_09 | AC | 132 ms
89,088 KB |
testcase_10 | AC | 132 ms
89,524 KB |
testcase_11 | AC | 131 ms
89,600 KB |
testcase_12 | AC | 133 ms
89,472 KB |
testcase_13 | AC | 130 ms
89,216 KB |
testcase_14 | AC | 134 ms
89,728 KB |
testcase_15 | AC | 134 ms
89,472 KB |
testcase_16 | AC | 137 ms
89,600 KB |
testcase_17 | AC | 133 ms
89,640 KB |
testcase_18 | AC | 133 ms
89,472 KB |
testcase_19 | AC | 135 ms
89,472 KB |
testcase_20 | AC | 142 ms
89,600 KB |
testcase_21 | AC | 135 ms
89,728 KB |
testcase_22 | AC | 136 ms
89,484 KB |
testcase_23 | AC | 136 ms
89,344 KB |
testcase_24 | AC | 135 ms
89,088 KB |
testcase_25 | AC | 137 ms
89,472 KB |
testcase_26 | AC | 132 ms
89,088 KB |
testcase_27 | AC | 137 ms
89,712 KB |
testcase_28 | AC | 137 ms
89,472 KB |
testcase_29 | AC | 140 ms
89,676 KB |
testcase_30 | AC | 140 ms
89,472 KB |
testcase_31 | AC | 135 ms
89,600 KB |
testcase_32 | AC | 136 ms
89,600 KB |
testcase_33 | AC | 143 ms
89,184 KB |
testcase_34 | AC | 156 ms
89,472 KB |
testcase_35 | AC | 138 ms
89,728 KB |
testcase_36 | AC | 134 ms
89,216 KB |
testcase_37 | AC | 134 ms
89,472 KB |
testcase_38 | AC | 140 ms
89,472 KB |
testcase_39 | AC | 128 ms
89,472 KB |
testcase_40 | AC | 135 ms
89,704 KB |
testcase_41 | AC | 138 ms
89,088 KB |
testcase_42 | AC | 133 ms
89,220 KB |
testcase_43 | AC | 138 ms
89,472 KB |
testcase_44 | AC | 132 ms
89,692 KB |
testcase_45 | AC | 138 ms
89,472 KB |
testcase_46 | AC | 140 ms
89,528 KB |
testcase_47 | AC | 141 ms
89,540 KB |
testcase_48 | AC | 137 ms
89,472 KB |
testcase_49 | AC | 134 ms
89,472 KB |
testcase_50 | AC | 134 ms
89,172 KB |
testcase_51 | AC | 132 ms
89,472 KB |
testcase_52 | AC | 131 ms
89,472 KB |
testcase_53 | AC | 134 ms
89,848 KB |
ソースコード
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(): M = int(input()) now = 1 for i in range(128): now *= 2 now %= M print(now) if __name__ == '__main__': main()