Given a positive integer n, itβs possible to find the with precision using binary search. You are asked to find the square root of n with precision by performing a binary search on the result k times.
Input
The input contains two integers n (2 β€ n β€ ) and k (1 β€ k β€ 100).
Output
The program should print the with a precision of performing k binary search splits.