結果
問題 | No.1464 Number Conversion |
ユーザー | McGregorsh |
提出日時 | 2023-05-20 12:20:44 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 236 ms / 2,000 ms |
コード長 | 1,568 bytes |
コンパイル時間 | 1,244 ms |
コンパイル使用メモリ | 87,056 KB |
実行使用メモリ | 92,648 KB |
最終ジャッジ日時 | 2023-08-23 08:59:43 |
合計ジャッジ時間 | 8,584 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 236 ms
92,440 KB |
testcase_01 | AC | 233 ms
92,404 KB |
testcase_02 | AC | 232 ms
92,516 KB |
testcase_03 | AC | 228 ms
92,552 KB |
testcase_04 | AC | 230 ms
92,516 KB |
testcase_05 | AC | 229 ms
92,208 KB |
testcase_06 | AC | 228 ms
92,540 KB |
testcase_07 | AC | 230 ms
92,340 KB |
testcase_08 | AC | 230 ms
92,648 KB |
testcase_09 | AC | 235 ms
92,496 KB |
testcase_10 | AC | 230 ms
92,348 KB |
testcase_11 | AC | 231 ms
92,292 KB |
testcase_12 | AC | 229 ms
92,336 KB |
testcase_13 | AC | 230 ms
92,560 KB |
testcase_14 | AC | 230 ms
92,224 KB |
testcase_15 | AC | 229 ms
92,536 KB |
testcase_16 | AC | 232 ms
92,344 KB |
testcase_17 | AC | 231 ms
92,352 KB |
testcase_18 | AC | 229 ms
92,292 KB |
testcase_19 | AC | 229 ms
92,404 KB |
testcase_20 | AC | 235 ms
92,460 KB |
testcase_21 | AC | 235 ms
92,304 KB |
testcase_22 | AC | 228 ms
92,296 KB |
testcase_23 | AC | 231 ms
92,260 KB |
testcase_24 | AC | 230 ms
92,544 KB |
testcase_25 | AC | 232 ms
92,472 KB |
testcase_26 | AC | 234 ms
92,524 KB |
testcase_27 | AC | 233 ms
92,436 KB |
testcase_28 | AC | 234 ms
92,440 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(): X = input() X += '0' * 10 if '.' in X: p = X.index('.') X = X[:p] + X[p+1:p+11] X = int(X) p = gcd(X, 10 ** 10) X //= p s = 10**10 // p print(str(X) + '/' + str(s)) if __name__ == '__main__': main()