結果
問題 | No.1161 Many Powers |
ユーザー | McGregorsh |
提出日時 | 2023-05-18 21:30:51 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 318 ms / 2,000 ms |
コード長 | 1,564 bytes |
コンパイル時間 | 375 ms |
コンパイル使用メモリ | 87,056 KB |
実行使用メモリ | 93,180 KB |
最終ジャッジ日時 | 2023-08-22 12:56:06 |
合計ジャッジ時間 | 8,123 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 236 ms
92,216 KB |
testcase_01 | AC | 233 ms
92,144 KB |
testcase_02 | AC | 232 ms
92,152 KB |
testcase_03 | AC | 231 ms
92,188 KB |
testcase_04 | AC | 229 ms
92,156 KB |
testcase_05 | AC | 237 ms
93,120 KB |
testcase_06 | AC | 235 ms
92,960 KB |
testcase_07 | AC | 229 ms
92,292 KB |
testcase_08 | AC | 270 ms
93,088 KB |
testcase_09 | AC | 271 ms
92,836 KB |
testcase_10 | AC | 253 ms
92,964 KB |
testcase_11 | AC | 263 ms
93,180 KB |
testcase_12 | AC | 247 ms
92,964 KB |
testcase_13 | AC | 284 ms
92,752 KB |
testcase_14 | AC | 308 ms
93,016 KB |
testcase_15 | AC | 303 ms
92,972 KB |
testcase_16 | AC | 318 ms
92,968 KB |
testcase_17 | AC | 289 ms
93,020 KB |
testcase_18 | AC | 273 ms
93,016 KB |
testcase_19 | AC | 255 ms
92,976 KB |
testcase_20 | AC | 316 ms
93,136 KB |
testcase_21 | AC | 257 ms
93,132 KB |
testcase_22 | AC | 312 ms
92,996 KB |
testcase_23 | AC | 234 ms
92,364 KB |
testcase_24 | AC | 237 ms
92,500 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(): A, B, C = i_map() P = A % C ans = 0 for i in range(1, C): cost = A // C if i <= P: cost += 1 score = cost * pow(i, B, C) % C ans += score ans %= C print(ans) if __name__ == '__main__': main()