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: Wrong Answer)

function parseInput(input) {
  const values = []
  input.split('\n').forEach(row => {
    const list = row.split(' ')
    list.forEach(v => values.push(v))
  })

  return values
}

function getInput() {
  const dummy = ``
  return parseInput(dummy || require('fs').readFileSync('/dev/stdin', 'utf8'))
}

;(function main() {
  const input = getInput()
  var N = +input[0]
  const K = +input[1]



  var count = 0
  while (N >= 0) {
    count++
    N -= Math.pow(K , count)
  }

  const c = Math.pow(10, 9) + 7
  console.log(count % c)
})()