結果
問題 | No.81 すべて足すだけの簡単なお仕事です。 |
ユーザー |
|
提出日時 | 2024-03-05 01:26:22 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,619 bytes |
コンパイル時間 | 290 ms |
コンパイル使用メモリ | 82,108 KB |
実行使用メモリ | 58,528 KB |
最終ジャッジ日時 | 2024-09-29 17:44:07 |
合計ジャッジ時間 | 2,456 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 1 WA * 29 |
ソースコード
import sysimport mathimport bisectfrom heapq import heapify, heappop, heappushfrom collections import deque, defaultdict, Counterfrom functools import lru_cachefrom itertools import accumulate, combinations, permutations, productsys.setrecursionlimit(1000000)MOD = 10 ** 9 + 7MOD99 = 998244353input = lambda: sys.stdin.readline().strip()NI = lambda: int(input())NMI = lambda: map(int, input().split())NLI = lambda: list(NMI())SI = lambda: input()SMI = lambda: input().split()SLI = lambda: list(SMI())EI = lambda m: [NLI() for _ in range(m)]def _main():N = NI()A = [SI() for _ in range(N)]Z = 0F = 0for S in A:if "." not in S:S += ".0"if S[0] != "-":z, f = S.split(".")z = int(z)f = f.ljust(10, "0")f = int(f)else:z, f = S.split(".")z = int(z)f = f.ljust(10, "0")f = -int(f)Z += zF += fx, r = divmod(F, 10**10)Z += xF = rif Z < 0 and F > 0:Z += 1F = 10**10 - FZ = "-" + str(abs(Z))print(f"{Z}.{str(F).zfill(10)}")def main():N = NI()A = [SI() for _ in range(N)]X = []for i in range(N):a = A[i]if "." not in a:X.append(int(a) * 10**10)else:z, f = a.split(".")f = f.ljust(10, "0")print(z, f)X.append(int(z+f))# print(X)ans = str(sum(X)).zfill(10)print(str(ans[:-10]) + "." + str(ans)[-10:])if __name__ == "__main__":main()