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 Fortran (gfortran v4.8.4) (judge verdict: Wrong Answer)

  Program Main

    Implicit None
    Integer(8)           :: N,K,M,digit

    N = 0
    K = 0
    digit = 1
    Read(*,*) N,K
    M = K
    N = N - M
    If (N == 0) digit = digit + 1 
    M = M*(K-1)
    If (N>0)then
       Check:Do 
                digit = digit + 1
                N = N - M 
                If (N <= 0) then
                   Exit Check
                Elseif (N == 0) then
                   digit = digit + 1
                   Exit Check
                Endif
                M = M*K
             Enddo Check
    Endif

    Write(*,"(I0)") digit

  End Program