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
    nnasy */

#include <stdio.h>

int main(void) {
    int number, baseNumber;    //整数変数の宣言
    scanf("%d %d", &number, &baseNumber);    //number, baseNumberに入力

    int count = 0;    //numberをbaseNumberで割れる回数(=numberをbaseNumber進数にした時の桁数)を表現する整数変数を宣言
    while (number>0){    //割れる回数(=count)を調べる
        number = number/baseNumber;
        count++;
    }
    printf("%d\n", count);    //求める桁数(=count)を出力

    return 0;
}