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 C (GCC 5.4.1) (judge verdict: Accepted)

/* ex3_3 melo */
#include <stdio.h>
int main(void){
    int Num, BaseN;//整数の箱を二つ用意する
    int digit=0;//桁数をいれる箱を用意し、0を代入する
    scanf("%d %d",&Num,&BaseN);//Num,BaseNに代入
    while(Num!=0){//NumをBaseNで割った商が0になるまで繰り返す
        Num=Num/BaseN;//割った時の商をNumに代入する（今回はNumをK進数で表す必要がないためあまりを考える必要はない）
        digit=digit+1;//桁数を+1する
    }
    printf("%d\n",digit);//何桁か表示
    return 0;
}