結果
問題 | No.1700 floor X |
ユーザー | McGregorsh |
提出日時 | 2023-05-10 15:26:41 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 521 ms / 2,000 ms |
コード長 | 1,627 bytes |
コンパイル時間 | 297 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 91,008 KB |
最終ジャッジ日時 | 2024-05-05 03:27:06 |
合計ジャッジ時間 | 21,864 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 137 ms
89,600 KB |
testcase_01 | AC | 431 ms
90,752 KB |
testcase_02 | AC | 455 ms
90,624 KB |
testcase_03 | AC | 431 ms
90,880 KB |
testcase_04 | AC | 434 ms
90,624 KB |
testcase_05 | AC | 428 ms
90,496 KB |
testcase_06 | AC | 435 ms
91,008 KB |
testcase_07 | AC | 426 ms
90,752 KB |
testcase_08 | AC | 437 ms
90,752 KB |
testcase_09 | AC | 437 ms
91,008 KB |
testcase_10 | AC | 436 ms
90,880 KB |
testcase_11 | AC | 451 ms
91,008 KB |
testcase_12 | AC | 453 ms
90,752 KB |
testcase_13 | AC | 430 ms
90,880 KB |
testcase_14 | AC | 436 ms
90,752 KB |
testcase_15 | AC | 434 ms
90,880 KB |
testcase_16 | AC | 429 ms
90,752 KB |
testcase_17 | AC | 431 ms
91,008 KB |
testcase_18 | AC | 447 ms
91,008 KB |
testcase_19 | AC | 447 ms
90,752 KB |
testcase_20 | AC | 428 ms
90,752 KB |
testcase_21 | AC | 445 ms
90,880 KB |
testcase_22 | AC | 439 ms
91,008 KB |
testcase_23 | AC | 511 ms
90,752 KB |
testcase_24 | AC | 521 ms
90,752 KB |
testcase_25 | AC | 448 ms
91,008 KB |
testcase_26 | AC | 436 ms
90,624 KB |
testcase_27 | AC | 441 ms
90,496 KB |
testcase_28 | AC | 460 ms
90,880 KB |
testcase_29 | AC | 448 ms
90,880 KB |
testcase_30 | AC | 478 ms
90,752 KB |
testcase_31 | AC | 443 ms
91,008 KB |
testcase_32 | AC | 440 ms
90,752 KB |
testcase_33 | AC | 445 ms
90,752 KB |
testcase_34 | AC | 442 ms
90,624 KB |
testcase_35 | AC | 440 ms
90,880 KB |
testcase_36 | AC | 432 ms
90,624 KB |
testcase_37 | AC | 439 ms
91,008 KB |
testcase_38 | AC | 434 ms
90,752 KB |
testcase_39 | AC | 442 ms
90,624 KB |
testcase_40 | AC | 465 ms
90,752 KB |
testcase_41 | AC | 433 ms
90,624 KB |
testcase_42 | AC | 144 ms
89,344 KB |
testcase_43 | AC | 440 ms
90,496 KB |
testcase_44 | AC | 437 ms
90,752 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(): T = int(input()) for i in range(T): N = int(input()) top = 10 ** 18 under = 0 while top - under > 1: mid = (top + under) // 2 if mid ** 2 <= N: under = mid else: top = mid print(under) if __name__ == '__main__': main()