結果
問題 | No.557 点対称 |
ユーザー | McGregorsh |
提出日時 | 2022-11-01 20:55:11 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,690 bytes |
コンパイル時間 | 287 ms |
コンパイル使用メモリ | 87,072 KB |
実行使用メモリ | 92,684 KB |
最終ジャッジ日時 | 2023-09-23 10:38:29 |
合計ジャッジ時間 | 8,827 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 234 ms
92,528 KB |
testcase_01 | AC | 232 ms
92,244 KB |
testcase_02 | AC | 233 ms
92,376 KB |
testcase_03 | AC | 231 ms
92,336 KB |
testcase_04 | AC | 230 ms
92,500 KB |
testcase_05 | AC | 230 ms
92,328 KB |
testcase_06 | AC | 233 ms
92,524 KB |
testcase_07 | AC | 232 ms
92,640 KB |
testcase_08 | AC | 234 ms
92,684 KB |
testcase_09 | AC | 233 ms
92,280 KB |
testcase_10 | AC | 234 ms
92,292 KB |
testcase_11 | AC | 235 ms
92,380 KB |
testcase_12 | AC | 233 ms
92,488 KB |
testcase_13 | AC | 239 ms
92,648 KB |
testcase_14 | AC | 232 ms
92,612 KB |
testcase_15 | AC | 233 ms
92,564 KB |
testcase_16 | AC | 233 ms
92,440 KB |
testcase_17 | AC | 240 ms
92,556 KB |
testcase_18 | AC | 233 ms
92,244 KB |
testcase_19 | AC | 234 ms
92,472 KB |
testcase_20 | AC | 234 ms
92,576 KB |
testcase_21 | AC | 236 ms
92,488 KB |
testcase_22 | AC | 232 ms
92,348 KB |
testcase_23 | AC | 233 ms
92,436 KB |
testcase_24 | AC | 233 ms
92,292 KB |
testcase_25 | WA | - |
testcase_26 | AC | 234 ms
92,540 KB |
testcase_27 | AC | 233 ms
92,484 KB |
testcase_28 | AC | 233 ms
92,548 KB |
testcase_29 | AC | 231 ms
92,336 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 == 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()