Problem:
Score : 200 points

Problem Statement

Given is an integer N. Find the number of digits that N has in base K.

Notes

For information on base-K representation, see Positional notation - Wikipedia.

Constraints

All values in input are integers.

1 \leq N \leq 10^9

2 \leq K \leq 10

Input

Input is given from Standard Input in the following format:

N K

Output

Print the number of digits that N has in base K.

Sample Input 1

11 2

Sample Output 1

4

In binary, 11 is represented as 1011.

Sample Input 2

1010101 10

Sample Output 2

7

Sample Input 3

314159265 3

Sample Output 3

18

Solution in PyPy3 (2.4.0) (judge verdict: Accepted)

#nとk進数
n, k = map(int, input().split())

#nをkで割った時の商
#s = n//k
dm = [n,0]
ha = ''
#nをkで割った余りをつなげることの繰り返し
while dm[0] > 0:
	dm = divmod(dm[0],k)
	ha += str(dm[1])


print(len(ha))