output_description: Print the number of digits that N has in base K.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N K
attempt: # -*- coding: utf-8 -*-
  
  import sys
  
  
  def input():
      return sys.stdin.readline().strip()
  
  
  def list2d(a, b, c):
      return [[c] * b for i in range(a)]
  
  
  def list3d(a, b, c, d):
      return [[[d] * c for j in range(b)] for i in range(a)]
  
  
  def list4d(a, b, c, d, e):
      return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
  
  
  def ceil(x, y=1):
      return int(-(-x // y))
  
  
  def INT():
      return int(input())
  
  
  def MAP():
      return map(int, input().split())
  
  
  def LIST(N=None):
      return list(MAP()) if N is None else [INT() for i in range(N)]
  
  
  def Yes():
      print("Yes")
  
  
  def No():
      print("No")
  
  
  def YES():
      print("YES")
  
  
  def NO():
      print("NO")
  
  
  sys.setrecursionlimit(10**9)
  INF = 10**18
  MOD = 10**9 + 7
  
  N, K = MAP()
  
  i = 0
  while K**i <= N:
      i += 1
  print(i)
  
problem_description: Statement
  
  Given is an integer N. Find the number of digits that N has in base K.
samples: [{"input": "11 2", "output": "4\n    \n\nIn binary, 11 is represented as `1011`.\n\n* * *"}, {"input": "1010101 10", "output": "7\n    \n\n* * *"}, {"input": "314159265 3", "output": "18"}]