結果

問題 No.428 小数から逃げる夢
ユーザー McGregorshMcGregorsh
提出日時 2023-05-16 14:47:16
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 1,773 bytes
コンパイル時間 1,055 ms
コンパイル使用メモリ 86,892 KB
実行使用メモリ 92,612 KB
最終ジャッジ日時 2023-08-21 05:58:21
合計ジャッジ時間 30,029 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 246 ms
92,272 KB
testcase_01 AC 251 ms
92,092 KB
testcase_02 AC 248 ms
92,148 KB
testcase_03 AC 250 ms
92,428 KB
testcase_04 AC 250 ms
92,292 KB
testcase_05 AC 251 ms
92,312 KB
testcase_06 AC 249 ms
92,316 KB
testcase_07 AC 249 ms
92,416 KB
testcase_08 AC 257 ms
92,104 KB
testcase_09 AC 252 ms
92,088 KB
testcase_10 AC 251 ms
92,312 KB
testcase_11 AC 251 ms
92,224 KB
testcase_12 AC 249 ms
92,284 KB
testcase_13 AC 245 ms
92,084 KB
testcase_14 AC 249 ms
92,320 KB
testcase_15 AC 249 ms
92,160 KB
testcase_16 AC 248 ms
92,300 KB
testcase_17 AC 254 ms
92,324 KB
testcase_18 AC 260 ms
92,224 KB
testcase_19 AC 251 ms
92,432 KB
testcase_20 AC 249 ms
92,324 KB
testcase_21 AC 245 ms
92,236 KB
testcase_22 AC 246 ms
92,360 KB
testcase_23 AC 250 ms
92,268 KB
testcase_24 AC 257 ms
92,416 KB
testcase_25 AC 247 ms
92,172 KB
testcase_26 AC 250 ms
92,220 KB
testcase_27 AC 253 ms
92,384 KB
testcase_28 AC 246 ms
92,284 KB
testcase_29 AC 249 ms
92,080 KB
testcase_30 AC 250 ms
92,244 KB
testcase_31 AC 250 ms
92,424 KB
testcase_32 AC 252 ms
92,436 KB
testcase_33 AC 250 ms
92,092 KB
testcase_34 AC 248 ms
92,220 KB
testcase_35 AC 249 ms
92,184 KB
testcase_36 AC 249 ms
92,336 KB
testcase_37 AC 249 ms
92,340 KB
testcase_38 AC 252 ms
92,140 KB
testcase_39 AC 255 ms
92,152 KB
testcase_40 AC 252 ms
92,412 KB
testcase_41 AC 251 ms
92,092 KB
testcase_42 AC 249 ms
92,344 KB
testcase_43 AC 248 ms
92,192 KB
testcase_44 AC 248 ms
92,124 KB
testcase_45 AC 249 ms
92,152 KB
testcase_46 AC 249 ms
92,360 KB
testcase_47 AC 252 ms
92,224 KB
testcase_48 AC 253 ms
92,328 KB
testcase_49 AC 250 ms
92,228 KB
testcase_50 AC 248 ms
92,100 KB
testcase_51 AC 250 ms
92,292 KB
testcase_52 AC 249 ms
92,148 KB
testcase_53 AC 253 ms
92,088 KB
testcase_54 AC 251 ms
92,380 KB
testcase_55 AC 251 ms
92,316 KB
testcase_56 AC 250 ms
92,360 KB
testcase_57 AC 251 ms
92,324 KB
testcase_58 AC 253 ms
92,172 KB
testcase_59 AC 252 ms
92,248 KB
testcase_60 AC 252 ms
92,336 KB
testcase_61 AC 250 ms
92,192 KB
testcase_62 AC 256 ms
92,332 KB
testcase_63 AC 248 ms
92,328 KB
testcase_64 AC 249 ms
92,140 KB
testcase_65 AC 251 ms
92,216 KB
testcase_66 AC 254 ms
92,192 KB
testcase_67 AC 251 ms
92,296 KB
testcase_68 AC 251 ms
92,100 KB
testcase_69 AC 251 ms
92,320 KB
testcase_70 AC 250 ms
92,228 KB
testcase_71 AC 249 ms
92,304 KB
testcase_72 AC 248 ms
92,288 KB
testcase_73 AC 253 ms
92,176 KB
testcase_74 AC 252 ms
92,272 KB
testcase_75 AC 251 ms
92,320 KB
testcase_76 AC 247 ms
92,320 KB
testcase_77 AC 254 ms
92,296 KB
testcase_78 AC 252 ms
92,312 KB
testcase_79 AC 249 ms
92,288 KB
testcase_80 AC 250 ms
92,152 KB
testcase_81 WA -
testcase_82 WA -
testcase_83 WA -
testcase_84 WA -
testcase_85 WA -
testcase_86 WA -
testcase_87 WA -
testcase_88 WA -
testcase_89 WA -
testcase_90 WA -
testcase_91 WA -
testcase_92 WA -
testcase_93 WA -
testcase_94 WA -
testcase_95 WA -
testcase_96 WA -
testcase_97 WA -
testcase_98 WA -
testcase_99 WA -
権限があれば一括ダウンロードができます

ソースコード

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[:1] + '.' + strp[2:])
   
   
if __name__ == '__main__':
    main()
0