結果
問題 | No.668 6.0*10^23 |
ユーザー | McGregorsh |
提出日時 | 2023-05-16 23:33:57 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,588 bytes |
コンパイル時間 | 284 ms |
コンパイル使用メモリ | 86,140 KB |
実行使用メモリ | 92,060 KB |
最終ジャッジ日時 | 2023-08-21 10:42:20 |
合計ジャッジ時間 | 16,435 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 236 ms
91,764 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 236 ms
91,560 KB |
testcase_10 | WA | - |
testcase_11 | AC | 242 ms
91,536 KB |
testcase_12 | AC | 239 ms
91,868 KB |
testcase_13 | WA | - |
testcase_14 | AC | 245 ms
91,768 KB |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | AC | 239 ms
91,944 KB |
testcase_18 | WA | - |
testcase_19 | AC | 238 ms
91,920 KB |
testcase_20 | AC | 236 ms
92,036 KB |
testcase_21 | AC | 236 ms
91,856 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 238 ms
91,768 KB |
testcase_26 | AC | 236 ms
91,836 KB |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | AC | 235 ms
92,020 KB |
testcase_30 | AC | 238 ms
91,552 KB |
testcase_31 | AC | 233 ms
91,560 KB |
testcase_32 | AC | 235 ms
91,980 KB |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | AC | 236 ms
91,764 KB |
testcase_38 | WA | - |
testcase_39 | AC | 235 ms
91,904 KB |
testcase_40 | AC | 234 ms
91,808 KB |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | AC | 236 ms
91,948 KB |
testcase_45 | AC | 237 ms
91,980 KB |
testcase_46 | AC | 236 ms
91,800 KB |
testcase_47 | AC | 239 ms
91,540 KB |
testcase_48 | AC | 253 ms
92,040 KB |
testcase_49 | AC | 237 ms
92,024 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 = input() lenN = len(N) if N[2] >= '5': p = int(N[:3]) + 1 else: p = int(N[:3]) strp = str(p) if p >= 995: lenN += 1 print(strp[0] + '.' + strp[1] + '*10^' + str(lenN-1)) if __name__ == '__main__': main()