結果

問題 No.428 小数から逃げる夢
ユーザー McGregorshMcGregorsh
提出日時 2023-05-16 14:49:38
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 258 ms / 1,000 ms
コード長 1,773 bytes
コンパイル時間 277 ms
コンパイル使用メモリ 87,220 KB
実行使用メモリ 92,628 KB
最終ジャッジ日時 2023-08-21 05:59:28
合計ジャッジ時間 28,811 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 247 ms
92,476 KB
testcase_01 AC 241 ms
92,468 KB
testcase_02 AC 241 ms
92,564 KB
testcase_03 AC 244 ms
92,372 KB
testcase_04 AC 245 ms
92,300 KB
testcase_05 AC 243 ms
92,304 KB
testcase_06 AC 238 ms
92,344 KB
testcase_07 AC 243 ms
92,340 KB
testcase_08 AC 243 ms
92,192 KB
testcase_09 AC 244 ms
92,500 KB
testcase_10 AC 239 ms
92,424 KB
testcase_11 AC 240 ms
92,428 KB
testcase_12 AC 247 ms
92,252 KB
testcase_13 AC 245 ms
92,500 KB
testcase_14 AC 247 ms
92,352 KB
testcase_15 AC 241 ms
92,608 KB
testcase_16 AC 247 ms
92,448 KB
testcase_17 AC 252 ms
92,412 KB
testcase_18 AC 258 ms
92,400 KB
testcase_19 AC 250 ms
92,216 KB
testcase_20 AC 245 ms
92,472 KB
testcase_21 AC 241 ms
92,428 KB
testcase_22 AC 238 ms
92,500 KB
testcase_23 AC 240 ms
92,456 KB
testcase_24 AC 244 ms
92,628 KB
testcase_25 AC 243 ms
92,568 KB
testcase_26 AC 245 ms
92,452 KB
testcase_27 AC 246 ms
92,296 KB
testcase_28 AC 246 ms
92,348 KB
testcase_29 AC 242 ms
92,312 KB
testcase_30 AC 243 ms
92,252 KB
testcase_31 AC 245 ms
92,216 KB
testcase_32 AC 243 ms
92,392 KB
testcase_33 AC 244 ms
92,452 KB
testcase_34 AC 243 ms
92,188 KB
testcase_35 AC 243 ms
92,352 KB
testcase_36 AC 245 ms
92,432 KB
testcase_37 AC 250 ms
92,152 KB
testcase_38 AC 254 ms
92,468 KB
testcase_39 AC 243 ms
92,216 KB
testcase_40 AC 247 ms
92,224 KB
testcase_41 AC 246 ms
92,256 KB
testcase_42 AC 245 ms
92,180 KB
testcase_43 AC 241 ms
92,404 KB
testcase_44 AC 239 ms
92,216 KB
testcase_45 AC 240 ms
92,264 KB
testcase_46 AC 241 ms
92,584 KB
testcase_47 AC 241 ms
92,484 KB
testcase_48 AC 240 ms
92,432 KB
testcase_49 AC 244 ms
92,392 KB
testcase_50 AC 242 ms
92,420 KB
testcase_51 AC 239 ms
92,440 KB
testcase_52 AC 240 ms
92,380 KB
testcase_53 AC 241 ms
92,520 KB
testcase_54 AC 241 ms
92,512 KB
testcase_55 AC 240 ms
92,224 KB
testcase_56 AC 244 ms
92,408 KB
testcase_57 AC 243 ms
92,436 KB
testcase_58 AC 244 ms
92,384 KB
testcase_59 AC 240 ms
92,460 KB
testcase_60 AC 244 ms
92,188 KB
testcase_61 AC 239 ms
92,512 KB
testcase_62 AC 241 ms
92,492 KB
testcase_63 AC 247 ms
92,168 KB
testcase_64 AC 245 ms
92,384 KB
testcase_65 AC 249 ms
92,392 KB
testcase_66 AC 241 ms
92,312 KB
testcase_67 AC 246 ms
92,596 KB
testcase_68 AC 243 ms
92,176 KB
testcase_69 AC 248 ms
92,520 KB
testcase_70 AC 243 ms
92,348 KB
testcase_71 AC 244 ms
92,380 KB
testcase_72 AC 241 ms
92,380 KB
testcase_73 AC 240 ms
92,404 KB
testcase_74 AC 242 ms
92,388 KB
testcase_75 AC 240 ms
92,600 KB
testcase_76 AC 244 ms
92,440 KB
testcase_77 AC 241 ms
92,380 KB
testcase_78 AC 244 ms
92,620 KB
testcase_79 AC 242 ms
92,380 KB
testcase_80 AC 243 ms
92,400 KB
testcase_81 AC 256 ms
92,172 KB
testcase_82 AC 244 ms
92,400 KB
testcase_83 AC 241 ms
92,464 KB
testcase_84 AC 241 ms
92,196 KB
testcase_85 AC 242 ms
92,500 KB
testcase_86 AC 241 ms
92,436 KB
testcase_87 AC 250 ms
92,432 KB
testcase_88 AC 243 ms
92,392 KB
testcase_89 AC 247 ms
92,184 KB
testcase_90 AC 245 ms
92,480 KB
testcase_91 AC 248 ms
92,452 KB
testcase_92 AC 249 ms
92,396 KB
testcase_93 AC 247 ms
92,328 KB
testcase_94 AC 246 ms
92,440 KB
testcase_95 AC 243 ms
92,452 KB
testcase_96 AC 246 ms
92,400 KB
testcase_97 AC 244 ms
92,436 KB
testcase_98 AC 246 ms
92,512 KB
testcase_99 AC 243 ms
92,372 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