問題
The integer square root of n is the square root rounded down: the largest integer r with r × r ≤ n. Library square roots work on floating point numbers and can be off by one for large inputs, so compute it with integers only, for example with a binary search over possible answers.
Implement integer_square_root(n).
Input
n: A non-negative integer.
Output
Return the largest integer r such that r × r ≤ n.
制約
0 ≤ n ≤ 10^18
例
入力:
n = 50
期待される出力:
expected = 7
入力:
long long n = 50;
期待される出力:
long long expected = 7;
入力:
long n = 50;
期待される出力:
long expected = 7;
解説
7 × 7 = 49 ≤ 50 but 8 × 8 = 64 > 50, so the answer is 7.
入力:
n = 144
期待される出力:
expected = 12
入力:
long long n = 144;
期待される出力:
long long expected = 12;
入力:
long n = 144;
期待される出力:
long expected = 12;
解説
144 is exactly 12 × 12, so the answer is 12.
解き方のヒント
まずは自分で考えてから、ヒントを 1 つずつ開いてみましょう。
ヒント 1
The answer lies between 0 and n, and r × r grows as r grows, so you can halve the range each step.
ヒント 2
For large n, r × r can overflow; compare r with n / r instead, or cap the upper bound.
ヒント 3
Check small inputs like 0, 1 and 3 by hand.
目安の計算量
O(log n) time, O(1) extra space
参考資料
この課題はCodeUtility用に調整されています。上記の説明と制約に従ってください。