結果

問題 No.1738 What's in the box?
ユーザー McGregorshMcGregorsh
提出日時 2022-07-26 15:15:59
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 172 ms / 2,000 ms
コード長 1,635 bytes
コンパイル時間 261 ms
コンパイル使用メモリ 81,792 KB
実行使用メモリ 90,112 KB
最終ジャッジ日時 2024-07-16 07:16:03
合計ジャッジ時間 13,547 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 144 ms
89,344 KB
testcase_01 AC 149 ms
89,216 KB
testcase_02 AC 149 ms
89,088 KB
testcase_03 AC 162 ms
89,856 KB
testcase_04 AC 168 ms
89,856 KB
testcase_05 AC 166 ms
90,048 KB
testcase_06 AC 166 ms
90,048 KB
testcase_07 AC 164 ms
90,112 KB
testcase_08 AC 160 ms
89,728 KB
testcase_09 AC 164 ms
89,856 KB
testcase_10 AC 171 ms
89,856 KB
testcase_11 AC 168 ms
89,856 KB
testcase_12 AC 167 ms
90,112 KB
testcase_13 AC 145 ms
89,088 KB
testcase_14 AC 145 ms
89,344 KB
testcase_15 AC 147 ms
89,260 KB
testcase_16 AC 154 ms
89,112 KB
testcase_17 AC 149 ms
89,216 KB
testcase_18 AC 145 ms
89,216 KB
testcase_19 AC 144 ms
89,344 KB
testcase_20 AC 151 ms
89,092 KB
testcase_21 AC 149 ms
89,216 KB
testcase_22 AC 149 ms
89,344 KB
testcase_23 AC 143 ms
89,088 KB
testcase_24 AC 148 ms
88,960 KB
testcase_25 AC 147 ms
89,600 KB
testcase_26 AC 143 ms
89,216 KB
testcase_27 AC 145 ms
89,344 KB
testcase_28 AC 151 ms
89,088 KB
testcase_29 AC 150 ms
89,600 KB
testcase_30 AC 142 ms
89,572 KB
testcase_31 AC 143 ms
89,344 KB
testcase_32 AC 146 ms
89,088 KB
testcase_33 AC 159 ms
89,728 KB
testcase_34 AC 167 ms
90,112 KB
testcase_35 AC 163 ms
89,984 KB
testcase_36 AC 164 ms
89,728 KB
testcase_37 AC 162 ms
89,984 KB
testcase_38 AC 163 ms
90,112 KB
testcase_39 AC 167 ms
89,856 KB
testcase_40 AC 167 ms
89,728 KB
testcase_41 AC 163 ms
90,112 KB
testcase_42 AC 161 ms
90,112 KB
testcase_43 AC 163 ms
89,728 KB
testcase_44 AC 168 ms
90,112 KB
testcase_45 AC 159 ms
89,728 KB
testcase_46 AC 163 ms
89,984 KB
testcase_47 AC 163 ms
89,856 KB
testcase_48 AC 161 ms
89,856 KB
testcase_49 AC 166 ms
90,112 KB
testcase_50 AC 172 ms
89,856 KB
testcase_51 AC 164 ms
90,112 KB
testcase_52 AC 165 ms
90,112 KB
testcase_53 AC 144 ms
89,216 KB
testcase_54 AC 145 ms
89,216 KB
testcase_55 AC 144 ms
89,088 KB
testcase_56 AC 146 ms
89,344 KB
testcase_57 AC 144 ms
89,088 KB
testcase_58 AC 147 ms
89,216 KB
testcase_59 AC 150 ms
89,088 KB
testcase_60 AC 151 ms
89,088 KB
testcase_61 AC 146 ms
89,512 KB
testcase_62 AC 146 ms
89,216 KB
testcase_63 AC 147 ms
89,088 KB
testcase_64 AC 144 ms
89,216 KB
testcase_65 AC 143 ms
89,216 KB
testcase_66 AC 143 ms
89,088 KB
testcase_67 AC 151 ms
89,088 KB
testcase_68 AC 152 ms
89,088 KB
testcase_69 AC 148 ms
89,184 KB
testcase_70 AC 143 ms
88,960 KB
testcase_71 AC 141 ms
89,088 KB
testcase_72 AC 141 ms
89,088 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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()
0