結果

問題 No.428 小数から逃げる夢
ユーザー McGregorshMcGregorsh
提出日時 2023-05-16 14:49:38
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 149 ms / 1,000 ms
コード長 1,773 bytes
コンパイル時間 198 ms
コンパイル使用メモリ 82,512 KB
実行使用メモリ 89,784 KB
最終ジャッジ日時 2024-05-08 11:32:37
合計ジャッジ時間 16,839 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 134 ms
89,228 KB
testcase_01 AC 136 ms
89,432 KB
testcase_02 AC 134 ms
89,164 KB
testcase_03 AC 136 ms
89,240 KB
testcase_04 AC 137 ms
89,724 KB
testcase_05 AC 135 ms
89,412 KB
testcase_06 AC 135 ms
89,532 KB
testcase_07 AC 136 ms
89,704 KB
testcase_08 AC 135 ms
89,168 KB
testcase_09 AC 132 ms
89,604 KB
testcase_10 AC 137 ms
89,172 KB
testcase_11 AC 133 ms
89,500 KB
testcase_12 AC 134 ms
89,580 KB
testcase_13 AC 135 ms
89,260 KB
testcase_14 AC 137 ms
89,632 KB
testcase_15 AC 137 ms
89,472 KB
testcase_16 AC 138 ms
89,428 KB
testcase_17 AC 138 ms
89,412 KB
testcase_18 AC 129 ms
89,252 KB
testcase_19 AC 134 ms
89,532 KB
testcase_20 AC 134 ms
89,156 KB
testcase_21 AC 133 ms
89,428 KB
testcase_22 AC 141 ms
89,560 KB
testcase_23 AC 146 ms
89,628 KB
testcase_24 AC 144 ms
89,640 KB
testcase_25 AC 143 ms
89,584 KB
testcase_26 AC 140 ms
89,172 KB
testcase_27 AC 146 ms
89,104 KB
testcase_28 AC 142 ms
89,232 KB
testcase_29 AC 142 ms
89,412 KB
testcase_30 AC 140 ms
89,440 KB
testcase_31 AC 144 ms
89,584 KB
testcase_32 AC 142 ms
89,172 KB
testcase_33 AC 140 ms
89,528 KB
testcase_34 AC 137 ms
89,028 KB
testcase_35 AC 139 ms
89,636 KB
testcase_36 AC 141 ms
89,636 KB
testcase_37 AC 139 ms
89,756 KB
testcase_38 AC 142 ms
89,524 KB
testcase_39 AC 149 ms
89,232 KB
testcase_40 AC 142 ms
89,584 KB
testcase_41 AC 144 ms
89,492 KB
testcase_42 AC 148 ms
89,676 KB
testcase_43 AC 141 ms
89,544 KB
testcase_44 AC 142 ms
89,420 KB
testcase_45 AC 143 ms
89,596 KB
testcase_46 AC 140 ms
89,652 KB
testcase_47 AC 142 ms
89,176 KB
testcase_48 AC 148 ms
89,168 KB
testcase_49 AC 144 ms
89,396 KB
testcase_50 AC 141 ms
89,496 KB
testcase_51 AC 146 ms
89,448 KB
testcase_52 AC 142 ms
89,416 KB
testcase_53 AC 141 ms
89,600 KB
testcase_54 AC 140 ms
89,636 KB
testcase_55 AC 139 ms
89,696 KB
testcase_56 AC 143 ms
89,432 KB
testcase_57 AC 146 ms
89,512 KB
testcase_58 AC 147 ms
89,556 KB
testcase_59 AC 145 ms
89,784 KB
testcase_60 AC 145 ms
89,456 KB
testcase_61 AC 144 ms
89,528 KB
testcase_62 AC 140 ms
89,584 KB
testcase_63 AC 144 ms
89,176 KB
testcase_64 AC 141 ms
89,420 KB
testcase_65 AC 137 ms
89,512 KB
testcase_66 AC 134 ms
89,676 KB
testcase_67 AC 137 ms
89,628 KB
testcase_68 AC 137 ms
89,460 KB
testcase_69 AC 137 ms
89,456 KB
testcase_70 AC 131 ms
89,584 KB
testcase_71 AC 135 ms
89,292 KB
testcase_72 AC 133 ms
89,592 KB
testcase_73 AC 132 ms
89,500 KB
testcase_74 AC 130 ms
89,448 KB
testcase_75 AC 127 ms
89,600 KB
testcase_76 AC 131 ms
89,496 KB
testcase_77 AC 133 ms
89,232 KB
testcase_78 AC 134 ms
89,448 KB
testcase_79 AC 137 ms
89,288 KB
testcase_80 AC 133 ms
89,572 KB
testcase_81 AC 134 ms
89,420 KB
testcase_82 AC 131 ms
89,224 KB
testcase_83 AC 130 ms
89,448 KB
testcase_84 AC 136 ms
89,580 KB
testcase_85 AC 134 ms
89,568 KB
testcase_86 AC 133 ms
89,424 KB
testcase_87 AC 134 ms
89,428 KB
testcase_88 AC 130 ms
89,568 KB
testcase_89 AC 132 ms
89,660 KB
testcase_90 AC 134 ms
89,616 KB
testcase_91 AC 131 ms
89,732 KB
testcase_92 AC 140 ms
89,572 KB
testcase_93 AC 136 ms
89,480 KB
testcase_94 AC 137 ms
89,424 KB
testcase_95 AC 130 ms
89,504 KB
testcase_96 AC 133 ms
89,572 KB
testcase_97 AC 133 ms
89,652 KB
testcase_98 AC 133 ms
89,568 KB
testcase_99 AC 130 ms
89,520 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, 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():
   
   D = '0.1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991'
   
   N = int(input())
   P = int(D[2:]) * N
   strp = str(P)
   
   if 1 <= N <= 8:
   	  print('0.' + strp)
   elif 9 <= N <= 81:
   	  print(strp[0] + '.' + strp[1:])
   else:
   	  print(strp[:2] + '.' + strp[2:])
   
   
if __name__ == '__main__':
    main()
0