結果
問題 | No.1343 Dividing Digit |
ユーザー | McGregorsh |
提出日時 | 2023-05-09 15:15:36 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 185 ms / 2,000 ms |
コード長 | 1,532 bytes |
コンパイル時間 | 330 ms |
コンパイル使用メモリ | 81,920 KB |
実行使用メモリ | 102,912 KB |
最終ジャッジ日時 | 2024-05-04 14:05:18 |
合計ジャッジ時間 | 5,865 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 124 ms
89,344 KB |
testcase_01 | AC | 132 ms
89,472 KB |
testcase_02 | AC | 118 ms
88,960 KB |
testcase_03 | AC | 179 ms
102,784 KB |
testcase_04 | AC | 125 ms
89,600 KB |
testcase_05 | AC | 142 ms
90,624 KB |
testcase_06 | AC | 129 ms
89,984 KB |
testcase_07 | AC | 157 ms
92,416 KB |
testcase_08 | AC | 174 ms
99,584 KB |
testcase_09 | AC | 185 ms
100,864 KB |
testcase_10 | AC | 140 ms
90,172 KB |
testcase_11 | AC | 147 ms
91,776 KB |
testcase_12 | AC | 155 ms
98,176 KB |
testcase_13 | AC | 153 ms
96,896 KB |
testcase_14 | AC | 127 ms
89,984 KB |
testcase_15 | AC | 145 ms
91,392 KB |
testcase_16 | AC | 128 ms
89,984 KB |
testcase_17 | AC | 173 ms
100,864 KB |
testcase_18 | AC | 171 ms
102,912 KB |
testcase_19 | AC | 154 ms
96,768 KB |
testcase_20 | AC | 141 ms
94,208 KB |
testcase_21 | AC | 173 ms
99,712 KB |
testcase_22 | AC | 169 ms
100,736 KB |
testcase_23 | AC | 172 ms
102,912 KB |
testcase_24 | AC | 168 ms
102,016 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, K = i_map() A = i_list() A = A[::-1] AA = sum(A) cou = 0 for i in range(N): cost = A[i] * pow(K, i, AA) cou += cost cou %= AA print(cou) if __name__ == '__main__': main()