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 JavaScript (node.js v5.12) (judge verdict: Accepted)

const base_n = (n,d)=> (n/d >= 1) ? base_n( Math.floor(n/d),d ) + (n%d).toString() : ( (n%d) || '1').toString();function Main(input) {
  input = input.trim().split(' ').map(data=>parseInt(data));
  console.log(base_n(input[0],input[1]).length)
}
Main(require("fs").readFileSync("/dev/stdin", "utf8"));