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 9.2.1) (judge verdict: Wrong Answer)

/*twitter:@chigaphys
  atcoder:chiga
  所属:久留米大学附設中学校
  color:gray*/
#include <bits/stdc++.h>
using namespace std;
int kamei(int x,int y){
if(x/y==0)return x;
return x%y+kamei(x/y,y)*10;
}
int main() {
  long long n;
  int m;
  cin>>n>>m;
int k=kamei(n,m);
  int i=1;
  while(k/10>0){
    k/=10;
    i++;
  }
  cout<<i<<endl;
}