結果
問題 | No.1092 modular arithmetic |
ユーザー | McGregorsh |
提出日時 | 2023-05-18 13:01:26 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 316 ms / 2,000 ms |
コード長 | 1,662 bytes |
コンパイル時間 | 696 ms |
コンパイル使用メモリ | 87,184 KB |
実行使用メモリ | 108,288 KB |
最終ジャッジ日時 | 2023-08-22 08:52:51 |
合計ジャッジ時間 | 14,037 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 240 ms
92,556 KB |
testcase_01 | AC | 269 ms
108,044 KB |
testcase_02 | AC | 240 ms
92,440 KB |
testcase_03 | AC | 292 ms
107,992 KB |
testcase_04 | AC | 290 ms
104,716 KB |
testcase_05 | AC | 289 ms
104,868 KB |
testcase_06 | AC | 275 ms
100,544 KB |
testcase_07 | AC | 282 ms
104,688 KB |
testcase_08 | AC | 284 ms
106,348 KB |
testcase_09 | AC | 282 ms
104,360 KB |
testcase_10 | AC | 276 ms
101,588 KB |
testcase_11 | AC | 278 ms
102,932 KB |
testcase_12 | AC | 272 ms
100,284 KB |
testcase_13 | AC | 266 ms
101,356 KB |
testcase_14 | AC | 270 ms
104,100 KB |
testcase_15 | AC | 253 ms
93,660 KB |
testcase_16 | AC | 264 ms
100,180 KB |
testcase_17 | AC | 266 ms
104,468 KB |
testcase_18 | AC | 291 ms
106,612 KB |
testcase_19 | AC | 273 ms
100,212 KB |
testcase_20 | AC | 290 ms
108,288 KB |
testcase_21 | AC | 281 ms
102,804 KB |
testcase_22 | AC | 286 ms
106,364 KB |
testcase_23 | AC | 312 ms
103,000 KB |
testcase_24 | AC | 267 ms
94,400 KB |
testcase_25 | AC | 295 ms
100,212 KB |
testcase_26 | AC | 307 ms
102,836 KB |
testcase_27 | AC | 254 ms
93,604 KB |
testcase_28 | AC | 290 ms
100,328 KB |
testcase_29 | AC | 316 ms
106,172 KB |
testcase_30 | AC | 295 ms
100,456 KB |
testcase_31 | AC | 256 ms
93,476 KB |
testcase_32 | AC | 293 ms
99,176 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(): P, N = i_map() A = i_list() S = input() now = A[0] for i in range(N-1): if S[i] == '+': now += A[i+1] if S[i] == '-': now -= A[i+1] if S[i] == '*': now *= A[i+1] if S[i] == '/': now *= pow(A[i+1], P-2, P) now %= P print(now) if __name__ == '__main__': main()