結果
問題 | No.81 すべて足すだけの簡単なお仕事です。 |
ユーザー | McGregorsh |
提出日時 | 2022-10-25 13:05:26 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 254 ms / 5,000 ms |
コード長 | 1,724 bytes |
コンパイル時間 | 1,092 ms |
コンパイル使用メモリ | 86,136 KB |
実行使用メモリ | 91,704 KB |
最終ジャッジ日時 | 2023-09-16 11:47:54 |
合計ジャッジ時間 | 10,145 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 229 ms
91,476 KB |
testcase_01 | AC | 233 ms
91,480 KB |
testcase_02 | AC | 236 ms
91,292 KB |
testcase_03 | AC | 229 ms
91,648 KB |
testcase_04 | AC | 238 ms
91,348 KB |
testcase_05 | AC | 235 ms
91,572 KB |
testcase_06 | AC | 238 ms
91,404 KB |
testcase_07 | AC | 229 ms
91,704 KB |
testcase_08 | AC | 231 ms
91,308 KB |
testcase_09 | AC | 254 ms
91,412 KB |
testcase_10 | AC | 233 ms
91,492 KB |
testcase_11 | AC | 235 ms
91,320 KB |
testcase_12 | AC | 234 ms
91,600 KB |
testcase_13 | AC | 241 ms
91,600 KB |
testcase_14 | AC | 237 ms
91,572 KB |
testcase_15 | AC | 238 ms
91,340 KB |
testcase_16 | AC | 234 ms
91,328 KB |
testcase_17 | AC | 234 ms
91,412 KB |
testcase_18 | AC | 244 ms
91,396 KB |
testcase_19 | AC | 233 ms
91,612 KB |
testcase_20 | AC | 236 ms
91,596 KB |
testcase_21 | AC | 232 ms
91,648 KB |
testcase_22 | AC | 239 ms
91,620 KB |
testcase_23 | AC | 249 ms
91,640 KB |
testcase_24 | AC | 230 ms
91,436 KB |
testcase_25 | AC | 229 ms
91,388 KB |
testcase_26 | AC | 233 ms
91,580 KB |
testcase_27 | AC | 231 ms
91,548 KB |
testcase_28 | AC | 231 ms
91,596 KB |
testcase_29 | AC | 239 ms
91,564 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 = int(input()) ans = 0 for i in range(N): ans += Decimal(input()) point = 0 sans = str(ans) for i in range(len(sans)): if sans[i] == '.': point = i break if point == 0: print(sans + '.0000000000') else: nokori = 10 - (len(sans) - point - 1) print(sans + '0' * nokori) if __name__ == '__main__': main()