結果
問題 | No.1161 Many Powers |
ユーザー | McGregorsh |
提出日時 | 2023-05-18 21:28:26 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,564 bytes |
コンパイル時間 | 923 ms |
コンパイル使用メモリ | 87,016 KB |
実行使用メモリ | 93,160 KB |
最終ジャッジ日時 | 2023-08-22 12:54:51 |
合計ジャッジ時間 | 9,592 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 231 ms
92,396 KB |
testcase_02 | AC | 230 ms
92,360 KB |
testcase_03 | AC | 233 ms
92,184 KB |
testcase_04 | WA | - |
testcase_05 | AC | 249 ms
92,976 KB |
testcase_06 | WA | - |
testcase_07 | AC | 241 ms
92,280 KB |
testcase_08 | AC | 272 ms
92,948 KB |
testcase_09 | AC | 277 ms
92,976 KB |
testcase_10 | AC | 255 ms
92,884 KB |
testcase_11 | WA | - |
testcase_12 | AC | 252 ms
93,144 KB |
testcase_13 | AC | 288 ms
93,160 KB |
testcase_14 | WA | - |
testcase_15 | AC | 304 ms
92,964 KB |
testcase_16 | AC | 320 ms
93,148 KB |
testcase_17 | AC | 293 ms
93,088 KB |
testcase_18 | AC | 277 ms
92,976 KB |
testcase_19 | WA | - |
testcase_20 | AC | 316 ms
92,976 KB |
testcase_21 | AC | 261 ms
92,964 KB |
testcase_22 | AC | 317 ms
93,104 KB |
testcase_23 | AC | 237 ms
92,484 KB |
testcase_24 | AC | 232 ms
92,344 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 = B // C if i <= P: cost += 1 score = cost * pow(i, B, C) % C ans += score ans %= C print(ans) if __name__ == '__main__': main()