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)

#include<stdio.h>
int main(){
    int n,k,si=0;
    char s[400000];
    scanf("%d %d",&n,&k);
    int tmp=k;
    while(1){
        if(n>=tmp){
            s[si++]=n%k+'0';
            n/=k;
        }
        else{
            s[si++]=n+'0';
            break;
        }
    }
    printf("%d\n",si);
    return 0;
}