結果
問題 | No.557 点対称 |
ユーザー | McGregorsh |
提出日時 | 2022-11-01 20:57:47 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 261 ms / 2,000 ms |
コード長 | 1,731 bytes |
コンパイル時間 | 308 ms |
コンパイル使用メモリ | 87,284 KB |
実行使用メモリ | 92,608 KB |
最終ジャッジ日時 | 2023-09-23 10:39:49 |
合計ジャッジ時間 | 9,756 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 255 ms
92,484 KB |
testcase_01 | AC | 256 ms
92,492 KB |
testcase_02 | AC | 251 ms
92,380 KB |
testcase_03 | AC | 255 ms
92,272 KB |
testcase_04 | AC | 255 ms
92,540 KB |
testcase_05 | AC | 257 ms
92,332 KB |
testcase_06 | AC | 258 ms
92,484 KB |
testcase_07 | AC | 255 ms
92,416 KB |
testcase_08 | AC | 254 ms
92,584 KB |
testcase_09 | AC | 252 ms
92,364 KB |
testcase_10 | AC | 254 ms
92,460 KB |
testcase_11 | AC | 257 ms
92,488 KB |
testcase_12 | AC | 258 ms
92,536 KB |
testcase_13 | AC | 256 ms
92,384 KB |
testcase_14 | AC | 254 ms
92,572 KB |
testcase_15 | AC | 251 ms
92,608 KB |
testcase_16 | AC | 255 ms
92,508 KB |
testcase_17 | AC | 257 ms
92,472 KB |
testcase_18 | AC | 258 ms
92,512 KB |
testcase_19 | AC | 256 ms
92,380 KB |
testcase_20 | AC | 260 ms
92,308 KB |
testcase_21 | AC | 251 ms
92,584 KB |
testcase_22 | AC | 252 ms
92,480 KB |
testcase_23 | AC | 260 ms
92,424 KB |
testcase_24 | AC | 255 ms
92,476 KB |
testcase_25 | AC | 252 ms
92,312 KB |
testcase_26 | AC | 261 ms
92,288 KB |
testcase_27 | AC | 250 ms
92,264 KB |
testcase_28 | AC | 251 ms
92,392 KB |
testcase_29 | AC | 257 ms
92,328 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(): N = int(input()) if N == 1: print(2) exit() if N == 2: print(4) exit() if N % 2 == 0: center = 5 num = N // 2 - 1 else: center = 3 num = N // 2 ans = 4 point = pow(5, num-1, MOD) ans *= point ans %= MOD if num > 0: ans *= center ans %= MOD print(ans) if __name__ == '__main__': main()