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)

/* Kadai3_3
   saitomo*/
#include<stdio.h>

int main(void){
  int num_10,num_k,count=1;//countは桁数を求める際に用いる。最初は1(桁)
  scanf("%d %d",&num_10,&num_k);
  while(num_10/num_k>0){//num_10をnum_kで割って小数点以下を切り捨てる。num_10>0の間に割った回数を数える
    num_10=num_10/num_k;
    count=count+1;
  }
  printf("%d\n",count);
  return 0;
}