結果
問題 | No.1738 What's in the box? |
ユーザー | McGregorsh |
提出日時 | 2022-07-26 15:15:59 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 278 ms / 2,000 ms |
コード長 | 1,635 bytes |
コンパイル時間 | 290 ms |
コンパイル使用メモリ | 86,768 KB |
実行使用メモリ | 93,920 KB |
最終ジャッジ日時 | 2023-09-23 07:23:43 |
合計ジャッジ時間 | 22,256 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 251 ms
92,396 KB |
testcase_01 | AC | 251 ms
92,224 KB |
testcase_02 | AC | 250 ms
92,504 KB |
testcase_03 | AC | 269 ms
93,888 KB |
testcase_04 | AC | 272 ms
93,800 KB |
testcase_05 | AC | 278 ms
93,804 KB |
testcase_06 | AC | 271 ms
93,392 KB |
testcase_07 | AC | 273 ms
93,380 KB |
testcase_08 | AC | 274 ms
93,764 KB |
testcase_09 | AC | 269 ms
93,828 KB |
testcase_10 | AC | 268 ms
93,820 KB |
testcase_11 | AC | 271 ms
93,528 KB |
testcase_12 | AC | 267 ms
93,396 KB |
testcase_13 | AC | 245 ms
92,492 KB |
testcase_14 | AC | 245 ms
92,568 KB |
testcase_15 | AC | 252 ms
92,332 KB |
testcase_16 | AC | 244 ms
92,268 KB |
testcase_17 | AC | 247 ms
92,468 KB |
testcase_18 | AC | 254 ms
92,400 KB |
testcase_19 | AC | 252 ms
92,492 KB |
testcase_20 | AC | 253 ms
92,560 KB |
testcase_21 | AC | 257 ms
92,488 KB |
testcase_22 | AC | 261 ms
92,404 KB |
testcase_23 | AC | 256 ms
92,548 KB |
testcase_24 | AC | 255 ms
92,496 KB |
testcase_25 | AC | 254 ms
92,564 KB |
testcase_26 | AC | 252 ms
92,612 KB |
testcase_27 | AC | 248 ms
92,552 KB |
testcase_28 | AC | 246 ms
92,548 KB |
testcase_29 | AC | 254 ms
92,420 KB |
testcase_30 | AC | 258 ms
92,584 KB |
testcase_31 | AC | 254 ms
92,596 KB |
testcase_32 | AC | 252 ms
92,380 KB |
testcase_33 | AC | 265 ms
93,836 KB |
testcase_34 | AC | 271 ms
93,696 KB |
testcase_35 | AC | 267 ms
93,648 KB |
testcase_36 | AC | 270 ms
93,860 KB |
testcase_37 | AC | 272 ms
93,804 KB |
testcase_38 | AC | 274 ms
93,580 KB |
testcase_39 | AC | 276 ms
93,800 KB |
testcase_40 | AC | 275 ms
93,728 KB |
testcase_41 | AC | 276 ms
93,804 KB |
testcase_42 | AC | 274 ms
93,752 KB |
testcase_43 | AC | 268 ms
93,864 KB |
testcase_44 | AC | 269 ms
93,476 KB |
testcase_45 | AC | 266 ms
93,484 KB |
testcase_46 | AC | 273 ms
93,824 KB |
testcase_47 | AC | 272 ms
93,808 KB |
testcase_48 | AC | 272 ms
93,868 KB |
testcase_49 | AC | 271 ms
93,920 KB |
testcase_50 | AC | 273 ms
93,628 KB |
testcase_51 | AC | 271 ms
93,856 KB |
testcase_52 | AC | 270 ms
93,820 KB |
testcase_53 | AC | 251 ms
92,324 KB |
testcase_54 | AC | 249 ms
92,452 KB |
testcase_55 | AC | 248 ms
92,320 KB |
testcase_56 | AC | 249 ms
92,272 KB |
testcase_57 | AC | 251 ms
92,572 KB |
testcase_58 | AC | 251 ms
92,504 KB |
testcase_59 | AC | 251 ms
92,368 KB |
testcase_60 | AC | 250 ms
92,580 KB |
testcase_61 | AC | 247 ms
92,616 KB |
testcase_62 | AC | 246 ms
92,532 KB |
testcase_63 | AC | 245 ms
92,432 KB |
testcase_64 | AC | 248 ms
92,500 KB |
testcase_65 | AC | 253 ms
92,372 KB |
testcase_66 | AC | 254 ms
92,544 KB |
testcase_67 | AC | 254 ms
92,572 KB |
testcase_68 | AC | 251 ms
92,576 KB |
testcase_69 | AC | 248 ms
92,516 KB |
testcase_70 | AC | 253 ms
92,308 KB |
testcase_71 | AC | 248 ms
92,544 KB |
testcase_72 | AC | 250 ms
92,508 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 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, m = i_map() w = i_list() if m == 0: print(*[0] * n) exit() sum_wight = sum(w) tanka = Fraction(sum_wight, m) ans = [0] * n for i in range(n): num = Fraction(w[i]) / Fraction(tanka) ans[i] = num print(*ans) if __name__ == '__main__': main()