Problem:
 Score : 200 points    Problem Statement  Takahashi has a deposit of 100 yen (the currency of Japan) in AtCoder Bank.  The bank pays an annual interest rate of 1 % compounded annually. (A fraction of less than one yen is discarded.)  Assuming that nothing other than the interest affects Takahashi's balance, in how many years does the balance reach X yen or above for the first time?      Constraints   101 \le X \le 10^{18}  All values in input are integers.         Input  Input is given from Standard Input in the following format:  X       Output  Print the number of years it takes for Takahashi's balance to reach X yen or above for the first time.        Sample Input 1 103      Sample Output 1 3   The balance after one year is 101 yen.  The balance after two years is 102 yen.  The balance after three years is 103 yen.   Thus, it takes three years for the balance to reach 103 yen or above.       Sample Input 2 1000000000000000000      Sample Output 2 3760       Sample Input 3 1333333333      Sample Output 3 1706

Solution (Python):
import math

def main():
    X = int(input())
    ans = 0
    Y = 100
    while True:
        if Y >= X:
            print(ans)
            break
        Y = Y + math.floor(Y*0.01)
        ans += 1

if __name__ == '__main__':
    main()

Solution (Python):
import math
X = int(input())
answer = 100
j = 0
while(answer <= X):
    answer = math.floor(answer * 1.01)
    j += 1
    if answer >= X:
        break
print(j)

Solution (Python):
X = int(input())
n = 0
a = 100
while True:
    a = int(a * 1.01)
    n += 1
    if a >= X :
        break
print(n)

Solution (Python):
import math
x = int(input())
i = 0
value = 100
while (value < x):
    i += 1
    value = math.floor(value*1.01)
    
print(i)

Solution (Python):
x = int(input())
y = 100
for i in range(10**18):
    if int(y * 1.01)>= x:
        print(i+1)
        break
    else:
        y = int(y*1.01)

Solution (Python):

import sys
from collections import Counter
from itertools import permutations, combinations

from math import gcd
from math import ceil, floor
from math import log10
import bisect
sys.setrecursionlimit(10 ** 6)
inf = float("inf")

def input():
    return sys.stdin.readline()[:-1]

def main():
    x = int(input())
    cnt = 0
    initial = 100
    while initial < x:
        initial = floor(initial * 1.01)
        cnt += 1
    print(cnt)

if __name__ == '__main__':
    main()

Solution (Python):
x = int(input())

money = 100
count = 0

for i in range(x+1):
    money = int(money*1.01)
    count += 1
    if money >= x:
        print(count)
        break

Solution (Python):
x = int(input())

yokin=100
year=0

while yokin<x:
  yokin=yokin+(int(yokin*0.01))
  year=year+1

print(year)

Solution (Python):
import math

def main():
    x = int(input())
    ans = 0
    pivot = 100
    while x > pivot:
        pivot =  math.floor(pivot * 1.01)
        ans += 1
    print(ans)      

if __name__ == '__main__':
  main()

Solution (Python):
if __name__ == "__main__":
    X = int(input())
    total = 100
    for i in range(1, 10**18):
        total = int(total *1.01) 
        if total >= X:
            print(i)
            break

Solution (Python):
import sys
X = int(input())

money = 100
interest = 1
for i in range(1, 10**5):
	money = int(money*1.01)
	if money >= X:
		print(i)
		sys.exit(0)

Solution (Python):
X=int(input())
money=100
year=0

while 1:
    year += 1
    money*=1.01
    money=int(money)
    if money >= X:
        break

print(year)

Solution (Python):
X = int(input())
money = 100
n = 0
while True:
    money = int(money * 1.01)
    n = n + 1 
    if money >= X:
        print(n)
        break

Solution (Python):
import math

x=int(input())

a=100
c=0

while a<x:
  a=int(a*1.01)
  c+=1

print(c)

Solution (Python):
import math









N = int(input()) 

i = 100
z = 1.01
count = 0
while i < N:
  i = math.floor(i * z)
  count = count + 1

print(count)

Solution (Python):
x = int(input())

m = 100

count = 0
while(m <= 1000000000000000000):
    
    if m >= x:
        break
    
    m = int(m * 1.01)
    
    count += 1
    
print(count)

Solution (Python):
from math import floor
x = int(input())
ans = 0
money = 100
while money < x:
    money = floor(money * 1.01)
    ans += 1
print(ans)

Solution (Python):
X=int(input())

tmp=100
cnt=0
while True:
    cnt+=1
    tmp=int(tmp*1.01)
    if(tmp>=X):
        break

print(cnt)

Solution (Python):
X = int(input())
ans = 100
count=0
while ans < X:
    ans = ans + ans//100
    count+=1
print(count)

Solution (Python):
x = int(input())
i = 0
m = 100
while True:
    i += 1
    m *= 1.01
    m = int(m)
    if m >= x:
        break
print(i)

Solution (Python):
X = int(input())
ans = 100
count = 0
while ans < X:
  ans = int(ans * 1.01)
  count += 1
print(count)

Solution (Python):
x = int(input())

m=100
count=0

while True:
    m=m+m//100
    count+=1
    if m>=x:
        break

print(count)

Solution (Python):
import math
ｋ=int(input())


x=100
for i in range(10000000000):
  x=math.floor(x*1.01)
  
  if x>=k:
    ans=i+1
    break
    
print(ans)

Solution (Python):
import numpy as np
from math import ceil, floor


x = int(input())
ans = 100
for i in range(1, 10 ** 4):
    ans = floor(1.01 * ans)
    if ans >= x:
        print(i)
        exit()

Solution (Python):
import numpy as np
x = int(input())
count = 0
origin = 100
while(1):
  origin *= 1.01
  origin = int(origin)
  count += 1
  if(x <= origin):
    break
print(count)

Solution (Python):


import math


X = int(input())


ans = 0
tmp_count = 100


while tmp_count<X:
    tmp_count = math.floor(tmp_count * 1.01)
    ans += 1


print(ans)

Solution (Python):

"""
from sys import stdin
n = int(stdin.readline().rstrip())
data = [stdin.readline().rstrip().split() for _ in range(n)]
print(data)
print(*data, sep='\n')
"""


"""
s =input()
s=list(input())
a=int(input())
x,y = map(int,input().split())	
li = input().split()	
li = list(map(int,input().split()))	
li = input().split('T')	
"""

X = int(input())
C =100
cnt = 0
while True:
    C += C//100
    cnt += 1
    if C>=X:
        break
print(cnt)

Solution (Python):
import sys
import math

input = sys.stdin.readline
MOD = 1000000007

X = int(input())

ans  = 100
cnt = 0
while X > ans:
    ans =int(ans*1.01)
    cnt+=1

print(cnt)

Solution (Python):


x = int(input())

n = 100
i = 0
while 1:
    n = n * 101 // 100
    i += 1
    if n >= x:
        print(i)
        break

Solution (Python):

import sys


def solve(X: int):
    a=100
    b=0
    while True:
        a=int(a*1.01)
        b+=1
        if a>=X:
            print(b)
            break
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    X = int(next(tokens))  
    solve(X)

if __name__ == '__main__':
    main()

Solution (Python):
n=int(input())
a=100
i=0
while a<n:
  i=i+1
  a=int(a*1.01)
print(i)

Solution (Python):
x=int(input())
kane=100
ans=0
while kane<x:
  kane=int(kane*1.01)
  ans=ans+1
print(ans)

Solution (Python):
x = int(input())

n = 0
b = 100

while b < x:
	n += 1
	b = int(1.01 * b)

print(n)

Solution (Python):
import math
x = int(input())
money = 100
c = 0
while money < x:
    c += 1
    money = math.floor(money*1.01)
print(c)

Solution (Python):
x = int(input())

def rainen(yen):
    rainen = int(1.01 * yen)
    return rainen

nen = 0
yokin = 100

while yokin < x:
    nen +=1
    yokin = rainen(yokin)

print(int(nen))

Solution (Python):
X = int(input())

A = 100
i = 0

while True:
  i += 1
  A += A // 100
  if A >= X:
    print(i)
    break

Solution (Python):
import math

x = int(input())

money = 100
i = 0
while True:
    i += 1
    money = money + math.floor(money*0.01)
    
    if money >= x:
        print(i)
        break

Solution (Python):
import math
x=int(input())
ans=100
cnt=0
while ans < x:
  cnt+=1
  ans=math.floor(ans*1.01)
print(cnt)

Solution (Python):
def main():
    X = int(input())
    M = 100

    for cycle in range(1,1000000000000000000) :
        M = int(M * (1.01))
        
        if M >= X :
            print(cycle)
            break

if __name__ == '__main__':
    main()

Solution (Python):

x=int(input())
money=100
y=0
while True:
    if money>=x:
        print(y)
        exit()
    else:
        money=(money*1.01)//1
        y+=1

Solution (Python):
x = int(input())

m = 100
r = 1.01
i = 0
while m < x:
    m = int(m*1.01)
    i += 1

print(i)

Solution (Python):
import math

X = int(input())

A = 100
t = 0
while A < X:
    A *= 1.01
    A = math.floor(A)
    t += 1

print(t)

Solution (Python):
import math

a = 100
amt = int(input())
t = 0
while (a < amt):
	a = math.floor(1.01 * a)
	
	t += 1
print(t)

Solution (Python):
import math
a=int(input())
count= 0
kane = 100
while True:
    count+=1
    kane = math.floor(kane*1.01)
    if kane>=a:
        print(count)
        break

Solution (Python):
import math
X=int(input())
c=100
ans=0
while c<X:
  c=math.floor(c*1.01)
  ans+=1
print(ans)

Solution (Python):
import math

x = int(input())
v = 100
i = 0

while True:
  if v >= x: break
  v = math.floor(v * 1.01)
  i += 1
  
print(i)

Solution (Python):
import math
X=int(input())
a=100
i=0
if 101<=X<=10**18:
    while a<X:
        a=a*1.01
        a=math.floor(a)
        i+=1
    print(i)

Solution (Python):
X = int(input())
year = 0
yen = 100
while(yen < X):
  yen = int(yen * 1.01)
  year += 1
  
print(year)

Solution (Python):









import os
import sys


def main():
    x=int(input())
    y=100
    for ans in range(1,3761):
        y = y + int(y*0.01)
        if y>=x:
            print(ans)
            return
    


if __name__ == "__main__":
    main()

Solution (Python):
import math
def main():
    X= int(input())
    r = 100
    for i in range(1, 4000):
        r *= 1.01
        r = int(r)
        if r >= X:
            return i
print(main())

Solution (Python):
x = int(input())
a = 100
cnt = 0
while True:
    if a < x:
        a = a*1.01
        a = a//1
        cnt = cnt + 1
    else:
        break
print(cnt)

Solution (Python):
x = int(input())

r = 100
i = 1.01
cnt = 0
while True:
    if r >= x:
        print(cnt)
        break
    r = int(r * i)
    cnt += 1

Solution (Python):
import math

def solve():
    m = 100
    count = 0
    while m < x:
        count += 1
        m = math.floor((m * 1.01))
    print(count)
    return


x = int(input())

solve()

Solution (Python):
x = int(input())

year = 0
mon = 100
while(True):
    if (mon >= x):
        print(year)
        break
    a = int(mon * 0.01)
    mon += a  
    year += 1

Solution (Python):
import math
x = int(input())
cnt = 1
a = 100
while True:
    a = math.floor(a * 1.01)
    if x <= a:
        print(cnt)
        exit()
    cnt += 1

Solution (Python):
import math

x = int(input())
balance = 100.0
ans = 0

while balance < x:
    ans += 1
    balance += math.floor(balance * 0.01)

print(ans)

Solution (Python):
from math import floor
x=int(input())
a=100
i=0
while 1:
  i+=1
  a=floor(a*1.01)
  if a>=x:
    print(i)
    exit()

Solution (Python):
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import permutations,combinations
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
from math import gcd,ceil,floor,factorial

from functools import reduce
from pprint import pprint

def myinput():
    return map(int,input().split())

def mylistinput(n):
    return [ list(myinput()) for _ in range(n) ]

def mycol(data,col):
    return [ row[col] for row in data ]

def mysort(data,col,reverse_flag):
    data.sort(key=lambda x:x[col],reverse=reverse_flag)
    return data

def mymax(data):
    M = -1*float("inf")
    for i in range(len(data)):
        m = max(data[i])
        M = max(M,m)
    return M

def mymin(data):
    m = float("inf")
    for i in range(len(data)):
        M = min(data[i])
        m = min(m,M)
    return m

def myoutput(ls,space=True):
    if space:
        if len(ls)==0:
            print(" ")
        elif type(ls[0])==str:
            print(" ".join(ls))
        elif type(ls[0])==int:
            print(" ".join(map(str,ls)))
        else:
            print("Output Error")
    else:
        if len(ls)==0:
            print("")
        elif type(ls[0])==str:
            print("".join(ls))
        elif type(ls[0])==int:
            print("".join(map(str,ls)))
        else:
            print("Output Error")

x = int(input())
a = 100
r = 1.01

m = 100
for i in range(1,3761):
    m = floor(m*r)
    if m>=x:
        print(i)
        exit()
    else:
        pass

Solution (Python):
import math

x = int(input())

y = 100
c = 0
while y < x:
    y = math.floor(y*1.01)
    c +=1

print(c)

Solution (Python):
x = int(input())
n = 100
count = 0
while n < x:
    n = (n*101) // 100
    count += 1

print(count)

Solution (Python):
x = int(input())

j = 100
time = 0
while j < x:
    j = int(j * 1.01)
    time += 1
print(time)

Solution (Python):
x = int(input())
l = [1]

total = 100
rate = 1

year = 0

while total < x :
    total = total + total // 100
    year += 1

print(year)

Solution (Python):
import sys
import math

def main():
    input = sys.stdin.readline
    X = int(input())
    count = 1
    s = 100
    while True:
        s = math.floor(s * 0.01) + s
        if s >= X:
            return count
        count += 1

if __name__ == '__main__':
    print(main())

Solution (Python):
import math

x = int(input())

n = 0
t = 100
while True:
  t = math.floor(t * (1.01))
  n += 1
  if t >= x:
    break

    
print(n)

Solution (Python):
import math
base = 100
X = int(input())
n = 0
while base < X:
    n = n + 1
    base = math.floor(base*1.01)

print(n)

Solution (Python):


import math
x = int(input())
kane = 100
ans = 0
while(kane<x):
    kane = int(kane * 1.01)
    ans += 1


print(ans)

Solution (Python):
import sys,os
from collections import defaultdict, deque
from math import ceil, floor
if sys.version_info[1] >= 5:
    from math import gcd
else:
    from fractions import gcd
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = (lambda *something: print(*something)) if 'TERM_PROGRAM' in os.environ else lambda *x: 0
def main(given=sys.stdin.readline):
    input = lambda: given().rstrip()
    LMIIS = lambda: list(map(int,input().split()))
    II = lambda: int(input())
    MOD = 10**9+7


    X = II()
    
    

    
    
    
    
    y = 0
    t = 100
    while t < X:
        t = t*1.01//1
        y += 1
    print(y)

if __name__ == '__main__':
    main()

Solution (Python):
import math
X = int(input())
yrCount = 0
money = 100
run = True
while run:
    if money>=X:
        break
    else:
        yrCount += 1
    money= math.floor(money*1.01)
print(yrCount)

Solution (Python):
n = int(input())
x = 100
y = 0
while x<n:
    x = int(x*1.01)
    y = y +1

print(y)

Solution (Python):
X=int(input())
A=100
count=0
while A<X:
    count+=1
    A=int(A*1.01)

print(count)

Solution (Python):
x=int(input())
i=0
s=100
while s<x:
  s=int(s*1.01)
  i+=1
print(i)

Solution (Python):

import sys


def solve(X: int):
    c = 100
    i = 0
    while c < X:
        c = int(c * 1.01)
        i += 1
    return i



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    X = int(next(tokens))  
    print(solve(X))

if __name__ == '__main__':
    main()

Solution (Python):
X = int(input())
cnt = 100
i = 0
while cnt < X:
    cnt += int(str(cnt)[:-2])
    i += 1

print(i)

Solution (Python):
X = int(input())
n = 100
c = 0
while n < X:
    n = int(n*1.01)
    c += 1
    
print(c)

Solution (Python):
import math
x=int(input())
money=100
cnt=0

while 1:
    cnt+=1
    money+=math.floor(money*0.01)
    if money>=x:
        print(cnt)
        exit()

Solution (Python):
X = int(input())
x = 100
i = 0
while x < X:
    i += 1
    x += x//100
print(i)

Solution (Python):
import math

X = int(input())

price = 100
year = 0

while price < X:
    price *= 1.01
    price = math.floor(price)
    year += 1

print(year)

Solution (Python):
import math
x = int(input())
account = 100
yearcount = 0
while True:
  account = math.floor(account * 1.01)
  yearcount += 1
  if account >= x:
    print(yearcount)
    break

Solution (Python):
X = input()

X = int(X)

money = 100
count = 0
while True:
    if X > money:
        money += int(money * 0.01)
    else:
        break
    count += 1

print(count)

Solution (Python):
X = int(input())

K = 100

y = 0

while True:
    y += 1
    K += K // 100
    if K >= X:
        break
    
print(y)

Solution (Python):
x = int(input())

i = 0
r = 100
while True:
    i += 1
    r = int(1.01 * r)
    if x <= r:
        print(i)
        break

Solution (Python):
x = int(input())
total = 100
count = 0

while 1:
    if total >= x:
        print(count)
        break
    total = int(total * 1.01)
    count += 1

Solution (Python):
x=int(input())

y=100
count=0
while x>y:
  count+=1
  y=int(y*1.01)
 
print(count)

Solution (Python):
X = int(input())
k = 0
a = 100
for i in range(100000):
    a = int(a * 1.01)
    k += 1
    if a >= X:
        break
print(k)

Solution (Python):
import math
k = int(input())
y = 100
i = 0

while (y<k):
    y = math.floor(y*1.01)
    i += 1

print(i)

Solution (Python):
import math


import sys
def input():
    return sys.stdin.readline().rstrip('\n')

def calc(X):
    a = 100
    n = 0
    while a < X:
        a = math.floor(a * 1.01)
        n += 1
    return n


X = int(input())
print(calc(X))

Solution (Python):
x=int(input())
ans=1
a=int(100*(1.01)**ans)
while a<x:
  ans+=1
  a*=1.01
  a=int(a)
print(ans)

Solution (Python):
X = int(input())

def next(X):
    return (X*101)//100

year = 0
money = 100
while money < X:
    money = next(money)
    year = year + 1
    
print(year)

Solution (Python):
def main():
    x = int(input())
    money = 100
    ans = 0
    while money < x:
        money = int(money * 1.01)
        ans += 1
    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
import math
x = int(input())
yen = 100
count = 0
while x > yen:
    yen = yen + math.floor(yen * 1 / 100)
    count += 1

print(count)

Solution (Python):
import math

X = int(input())
money = 100
a = 1
while True :
    money += math.floor(money * 0.01)
    if money >= X:
        print(a)
        break
    a += 1

Solution (Python):
import math

x = int(input())
money = 100
year = 0
while money < x:
    year += 1
    money = math.floor(money * 1.01)
print(year)

Solution (Python):
x = int(input())
sum = 100
r = 0.01
for i in range(1, 10**6):
    sum = int(sum*(1 + r))
    if sum >= x:
        print(i)
        break

Solution (Python):
x=int(input())
L=[100]+[0]*10**4
for i in range(10000):
    L[i+1]=int(L[i]*1.01)
    if L[i+1]>=x:
        print(i+1)
        exit()

Solution (Python):
x = int(input())
import math


sum_i = 100

for i in range(4000):
    sum_i = sum_i * 1.01
    sum_i = math.floor(sum_i)
    if sum_i >= x:
        print(i+1)
        break

Solution (Python):
k=int(input())
n=100
y=0
while(n<k):
    n=int(n*1.01)
    y+=1
    
print(y)

Solution (Python):

import math
x = int(input())
i = 1
money = 100
while True:
    money = math.floor((money * (1.01))) 
    if money >= x:
        print(i)
        break
    i += 1

Solution (Python):
x=int(input())
cnt=0
money=100
for i in range(1,100000000000000000000000000):
  money=money*1.01//1
  cnt+=1
  if money>=x:
    break
print(cnt)

Solution (Python):
import math

X = int(input())

cur = 100
i = 0

while cur < X:
  cur = math.floor(cur * 1.01)
  i += 1
  
print(i)

Solution (Python):
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush, nlargest, nsmallest
from math import ceil, floor, gcd, fabs, factorial, fmod, sqrt, inf, log
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from fractions import Fraction



mod = pow(10, 9) + 7
mod2 = 998244353
def data(): return sys.stdin.readline().strip()
def out(*var, end="\n"): sys.stdout.write(" ".join(map(str, var))+end)
def l(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]


n = int(data())
initial = 100
i = 1
while True:
    initial += initial//100
    if initial >= n:
        out(i)
        exit()
    i += 1

Solution (Python):
import math
x = int(input())
y = 0
total = 100
while total < x:
    total *= 1.01
    total = math.floor(total)
    y += 1
print(y)

Solution (Python):
import sys
input = sys.stdin.readline
def main():
    X = int(input())
    M = 100
    flag = True
    CNT = 0
    while flag == True:
        CNT += 1
        M += int(M*0.01)
        if M >= X:
            flag = False
    print(CNT)

if __name__ == '__main__':
    main()

Solution (Python):
import math
x = int(input())
y = 0
s = 100

while s < x:
    s = math.floor(s * 1.01)
    y += 1

print(y)

Solution (Python):
x = int(input())
ini = 100
ans = 0

while True:
  ans += 1
  ini = int(ini*1.01)
  if ini >= x:
    print(ans)
    break

Solution (Python):

import itertools

def solve(x: int) -> int:
    y = 100
    for i in itertools.count(1):
        y = y * 101 // 100
        if x <= y:
            return i


def main():
    X = int(input())
    unz = solve(X)
    print(unz)

if __name__ == '__main__':
    main()

Solution (Python):

def resolve():
    X = int(input())

    yokin = 100
    ans = 0
    while yokin < X:
        yokin = yokin + yokin // 100
        ans += 1
    print(ans)

if __name__ == "__main__":
    resolve()

Solution (Python):

import sys
import itertools
import fractions
import copy
import bisect


import math
from operator import itemgetter
from sys import stdin

from operator import mul
from functools import reduce
from collections import Counter





N=3
M=3
i=0
j=0
k=0
n=3
r=1
a=[0]*5
b=[]




X=int(input())
mo=100
year=0





"1行1つの整数を入力を取得し、整数と取得する"
for i in range(100000000000):
    mo=math.floor(mo*(1.01))
    year+=1
    if mo >= X:
        print(year)
        sys.exit()



"12 21 332 とか入力する時に使う"
"1行に複数の整数の入力を取得し、整数として扱う"

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''

for i in number_list:
    print(number_list[i-1])

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''

'''
x=[]
y=[]
for i in range(N):
    x1, y1=[int(i) for i in input().split()]
    x.append(x1)
    y.append(y1)
print(x)
print(y)
"複数行に2数値を入力する形式 x座標とy座標を入力するイメージ"
'''

'''
mixlist=[]
for i in range(N):
    a,b=input().split()
    mixlist.append((int(a),b))
print(mixlist)
"複数行にintとstrを複合して入力するやつ，今回はリスト一つで処理している"
'''

'''



"正方行列にstr型の値を入力"
'''




'''
入力
1 2
4 5
7 8
出力結果
[[1, 2], [4, 5], [7, 8]]
'''
"列数に関して自由度の高いint型の値を入力するタイプの行列"


'''
table = [[int(i) for i in input().split()] for m in range(m)]

print(type(N))
print(N)
print(type(M))
print(M)

print(type(table))
print(table)
'''











'''
入力
1234
出力
1
[[1, 2, 3, 4]]
'''




'''
word_list= input().split(" ")
print(word_list[0])
"連続文字列の入力"
"qw er ty とかの入力に使う"
"入力すると空白で区切ったところでlistの番号が与えられる"
'''



'''
A, B, C=stdin.readline().rstrip().split()
print(A)
"リストではなく独立したstr型を入れるなら以下のやり方でOK"
'''




"aという変数に入っているものを大文字にして出力"















'''
コンビネーションの組み合わせの中身を出力する形式
for i in itertools.combinations(brray, 2)
combinationsをpermutationsにすれば順列になる
今回なら(abc133B)
入力
1 2
5 5
-2 8
出力
[[1, 2], [5, 5], [-2, 8]]
もちろん一次元リストでも使えるし
何よりiもリストのように使えるので便利
'''


'''
def cmb(n,r):
    
    r= min(n-r,r)
    
    if r == 0: return 1
    over = reduce(mul, range(n, n-r, -1))
    
    
    

    under = reduce(mul, range(1, r+1))
    
    
    
    

    return over // under
    
    
    
    
a = cmb(n, r)

'''

'''




for i in a.most_common(n):print(i)





 


'''









'''
bisect.bisect_left(a, x, lo=0, h=len(a))
引数
a: ソート済みリスト
x: 挿入したい値
lo: 探索範囲の下限
hi: 探索範囲の上限
(lo, hiはスライスと同様の指定方法)
bisect_leftはソートされたリストaに対して順序を保ったままxを挿入できる箇所を探索します。leftが示す通り、aにすでにxが存在している場合は、挿入箇所は既存のxよりも左側になります。また、lo, hiを指定することで探索範囲を絞り込むことも可能です。デフォルトはaの全体が探索対象です。
'''

Solution (Python):
X=int(input())
i,m=0,100
while m<X:
    m=m*101//100
    i+=1
print(i)

Solution (Python):

def main():
    X = int(input())
    yokin = 100
    cnt = 0

    while X > yokin:
        yokin = (int)(yokin*1.01)
        cnt += 1

    print(cnt)


if __name__ == '__main__':
    main()

Solution (Python):
x = int(input());

ans = 1;
a = 100;
while x>int(a*1.01) :
    ans += 1;
    a = int(a*1.01);

print(ans);

Solution (Python):
X = int(input())
count = 0
hun = 100
while X > hun:
  count += 1
  hun = int(hun*1.01)
print(count)

Solution (Python):
X=int(input())
a=100
ans=0
while a<X:
    a=int(a*1.01)
    ans+=1
    if a>=X:
        break
print(ans)

Solution (Python):
X = int(input())
y = 100
count = 0
while(y<X):
    y = y + int(0.01 * y)
    count += 1
    
print(count)

Solution (Python):
X = int(input())

import math

tyokin = 100
year_count = 0
for i in range(9999):
    tyokin = math.floor(tyokin * 1.01)
    year_count += 1
    
    if tyokin >= X:
        break
        
print(year_count)

Solution (Python):
import sys

sys.setrecursionlimit(200000000)

def kane(l,n,m):
    l *= 1.01
    l = l // 1
    n += 1
    if l >= m:
        print(n)
        exit()
    kane(l,n,m)

X = int(input())
kane(100,0,X)

Solution (Python):
x = int(input())
s = float(100.0)
count = 0

while s < x:
    s = int(s*1.01)
    
    count += 1

print(count)

Solution (Python):
X=int(input())

A=100
for i in range(100000):
    A = int(A*1.01)
    if A >= X:
        break

print(i+1)

Solution (Python):
x=int(input())
m=100
i=0
while m<x:
    m=int(1.01*m)
    i+=1
print(i)

Solution (Python):
n = int(input())
now = 100
y = 0
while(n > now):
  y += 1
  now = int(now * 1.01)
  
print(y)

Solution (Python):
x = int(input())
now = 100
ans = 0
while x > now:
    now = int(now * 1.01)
    ans += 1
print(ans)

Solution (Python):
import math

border = int(input()) 

i = 1
X = math.floor(100 * 1.01)
while True:
	if X >= border:
		print(i)
		exit()
	i += 1
	X = math.floor(X * 1.01)

Solution (Python):
n = int(input())
ans = 0
x = 100
while x<n:
    x = x+(x//100)
    ans+=1
print(ans)

Solution (Python):
X=int(input())
M=100
k=0
while X>M:
  M=(M*1.01)//1
  k+=1
print(k)

Solution (Python):
X = int(input())


N = 100
n = 1
while True:
    N = int(N*1.01)
    if N >= X:
        break
    n += 1
print(n)

Solution (Python):
import math

X = int(input())

m = 100
i = 0

while m > 99:
    m  = m * 1.01
    m  = math.floor(m)
    i  = i + 1
    if X <= m:
        print(i)
        break

Solution (Python):
x=int(input())
money=100
count=0
while money<x:
    money=int(money*1.01)
    count+=1
print(count)

Solution (Python):
x = int(input())
count = 0
m = 100
while x > m:
    count += 1
    m += m // 100
print(count)

Solution (Python):
X = int(input())

P = 100
ans = 0

while P < X:
    P = int(P*1.01)
    ans += 1

print(ans)

Solution (Python):
import math
start = 100
end = int(input())
count = 0
while(start < end):
    start *= 1.01
    start = math.floor(start)
    count += 1
print(count)

Solution (Python):
x = int(input())

ans = 0
deposit = 100
while deposit < x:
  deposit = int(deposit*1.01)
  ans += 1
print(ans)

Solution (Python):
X = int(input())
result = 0
money = 100
while money < X:
    money = int(money * 1.01)
    result += 1
print(result)

Solution (Python):
X = int(input())
a = 100
i = 0

while a < X:
  i += 1
  a += a // 100
  
print(i)

Solution (Python):
x=int(input())
money=100
year=0
ans=0
while money<x:
    money=int(money*1.01)
    year=year+1
    if money>=x:
        ans=year
print(ans)

Solution (Python):
X = int(input())
x = 100
count = 0

while x < X:
    x *= 1.01
    x = int(x)
    count += 1

print(count)

Solution (Python):
X = int(input())

m = 100
num = 0

while(m < X):
  m += m * 0.01
  m = int(m)
  num += 1
print(num)

Solution (Python):
import math
x=int(input())
n=100
ans=0
while True:
  if n>=x:
    print(ans)
    exit()
  ans+=1
  n=math.floor(n*1.01)

Solution (Python):
x = int(input())
count=0
amount = 100
while(amount<x):
    amount=int(amount*(1+0.01))
    count+=1
print(count)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
 
X = INT()
 
a = 100
ans = 0
 
while a < X:
	a = int(1.01*a)
	ans += 1
 
print(ans)

Solution (Python):
x = int(input())
tmp = 100
i = 0

while tmp < x:
    tmp = int(tmp*1.01)
    i+=1
print(i)

Solution (Python):


from math import floor
import sys
x = int(input())

y = 100

for i in range(1000000):
    y = floor(y + y * 0.01)
    if y >= x:
        print(i + 1)

        sys.exit()

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float("INF")


def solve():
    x = II()
    k = 100
    i = 0
    while k < x:
        k *= 1.01
        k = int(k)
        i += 1
    print(i)
    return



if __name__ == '__main__':
    solve()

Solution (Python):
import math
X = int(input())
money=100
ans=0
while money<X:
    money=math.floor(money*1.01)
    ans+=1
print(ans)

Solution (Python):
x = int(input())

m = 100
year = 0
while m<x:
	m = int(m*1.01)
	year += 1

print(year)

Solution (Python):
X =int(input())
year = 0
yokin = 100

while True:
    yokin = int(yokin+yokin*0.01)
    year += 1

    if yokin >= X:
        print(year)
        break

Solution (Python):
X = int(input())
start = 100
year = 0
while start < X:
  start = int(start * 1.01)
  year += 1
else:
  print(year)

Solution (Python):

from math import *

mod = (10**9) + 7


def _in():
    return [int(x) for x in input().split(' ')]


if __name__ == "__main__":
    k = int(input())
    curr, cnt = 100, 0
    while(curr < k):
        curr = int(curr * (1.01))
        cnt = cnt + 1
    print(cnt)

Solution (Python):
x=int(input())
i=1
a=100
while True:
    a= int(a*1.01)
    if(a>=x):
        break
    i+=1
print(i)

Solution (Python):
import math
x = int(input())
y = 0
m = 100
while m < x:
    m =  math.floor(m * 1.01)
    y += 1

print(y)

Solution (Python):
X = int(input())

balance = 100
year = 0

while balance < X:
    balance = int(balance * 1.01)
    year += 1

print(year)

Solution (Python):
from math import log

X=int(input())
k=1
now = 100
while now*1.01//1<X:
    k+=1
    now*=1.01
    now=now//1

print(k)