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):
X = int(input())
m = 100
for n in range(5000):
  m = int(m*1.01)
  if m >= X:
    print(n+1)
    break

Solution (Python):
import math

x = int(input())
depo = 100
ans = 0
while x > depo:
    depo += math.floor(depo*0.01)
    ans += 1
print(ans)

Solution (Python):
n = 100
ans = 0
X = int(input())

while n < X:
    n = n + int(n*0.01)
    ans += 1
    
print(ans)

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

A = 100
r = 0.01

i = 0
while A < X:
  A = int(A*(1+r))
  i = i + 1

print(i)

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

value = 100

for i in range(10**18):
    value = int(value * 1.01)
    if value >= X:
        print(i+1)
        break

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

print(ans)

Solution (Python):
import math


x = int(input())

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

print(ans)

Solution (Python):
import math

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

while yokin < X:
    year += 1
    yokin += math.floor(yokin * 0.01)
print(year)

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

while True:
  money = int(money*1.01)
  count +=1
  if money >= X:
    break
print(count)

Solution (Python):
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


X = int(read())
money =  100
flag = False
i = 0
while(not flag):
    money = money + int(money//100)
    i+=1
    if(money >= X) : flag = True

print(i)

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

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

x = 100
cnt = 0

while(1):
    x *= 1.01
    x = int(x)
    cnt += 1
    if x >= k:
        break
        
print(cnt)

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

count = 1
a = 100
while True:
  a *= 1.01
  a = int(a)
  if int(a) >= x:
    break
  else:
    count += 1
print(count)

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

while P < X:
  P += int(P * 0.01)
  count += 1

print(count)

Solution (Python):
x=int(input())
now=int(100)
for i in range(5000):
    if now>=x:
        print(i)
        exit()
    now+=int(now*0.01)

Solution (Python):
import math

def resolve():
    
    X = int(input())
    keika = 0
    yokin = 100

    while yokin < X:
        keika += 1
        yokin += math.floor(yokin * 0.01)

    print(keika)


if __name__ == "__main__":
    resolve()

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

Solution (Python):
def main():
    from decimal import Decimal, ROUND_DOWN

    X = Decimal(input())

    deposit = Decimal('100')
    rate = Decimal('1.01')

    cnt = 0
    while deposit < X:
        deposit = (deposit * rate).to_integral_exact(rounding=ROUND_DOWN)
        cnt += 1

    print(cnt)


if __name__ == '__main__':
    main()

Solution (Python):
import math
X=int(input())
m=100
i=0
while m<X:
    m+=math.floor(m/100)
    i+=1
print(i)

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

Solution (Python):
import sys
input = sys.stdin.readline
import math
def main():
    X = int(input())
    ans = 0
    val = 100
    while val < X:
        val = math.floor(val * 1.01)
        ans += 1
    print(ans)
if __name__ == "__main__":
    main()

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

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

while a < x:
  a += a//100
  ans += 1
print(ans)

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

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

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

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

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

sm = 100
count = 0

while sm < x:
    count += 1
    sm += int(0.01*sm)

print(count)

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

Solution (Python):

x = int(input())
counter = 0
goukei = 100

while goukei < x:
    goukei = int( goukei * 1.01)
    counter += 1
    
print(counter)

Solution (Python):
import math

x = int(input())
counter = 0
goukei = 100

while goukei < x:
    goukei = math.floor(goukei * 1.01)         
    counter += 1
    
print(counter)

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

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

while True:
  if a >= X:
    print(count)
    break
  a *= 1.01
  a = int(a)
  count += 1

Solution (Python):

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

print(y)

Solution (Python):

x = int(input())
 
year = 0
cur = 100
 
while cur < x:
  year += 1
  cur = int(cur * 1.01)
 
print(year)

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

while n < x:
    n += int(n / 100)
    i += 1

print(i)

Solution (Python):

"""
Created on Sat May  2 19:45:18 2020

@author: harsh
"""


import math
x=int(input())
rate=100
i=1
while(True):
    if(rate>=x):
        print(i-1)
        break
    else:
        rate=int(rate*1.01)
        i+=1

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

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

print(year)

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

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

print(i)

Solution (Python):

x = int(input())
counter = 0
goukei = 100

while goukei < x:
    goukei = int(goukei*1.01)         
    counter += 1
    
print(counter)

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

year = 0
cur = 100

while cur < x:
	year += 1
	cur = int(cur * 1.01)

print(year)

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

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

deposit = 100
num = 0

while deposit < x:
    deposit = math.floor (deposit * 1.01)
    num += 1

print(num)

Solution (Python):
x=int(input())
s=100
for i in range(3760):
    s=int(s*1.01)
    if s>=x:
        print(i+1)
        break

Solution (Python):
import math
x=int(input())
y=100
count=0
for i in range(1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000):
    y+=math.floor(y*0.01)
    count+=1
    if y>=x:
        break
print(count)

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

Solution (Python):

x = int(input())
counter = 0
goukei = 100

while goukei < x:
    goukei += int( goukei * 0.01)
    counter += 1
    
print(counter)

Solution (Python):
X = int(input())
a, b = 100, 1
while 1:
    a += int(a * 0.01)
    if a >= X:
        print(b)
        break
    b += 1

Solution (Python):
import math
X = int(input())
a, b = 100, 1
while 1:
    a += int(a * 0.01)
    if a >= X:
        print(b)
        break
    b += 1

Solution (Python):
import sys
import itertools

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

X = int(read())

x = 100
for year in itertools.count():
    if x >= X:
        break
    x = int(x * 1.01)
print(year)

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

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    x = int(input())

    year = 0
    money = 100
    
    from math import floor
    
    while money < x:
        money *= 1.01
        money = floor(money)
        year += 1

    print(year)


if __name__ == '__main__':
    main()

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


for i in range(1, 3761):
    s = int(s + s * 0.01)
    if s >= X:
        break
print(i)

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

Solution (Python):

x = int(input())

cnt = 0
answer = 100





















while answer < x:
    cnt += 1
    answer += answer // 100
    
    

print(cnt)

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

Solution (Python):
import math

N = int(input())


sum = 100
i = 0





while sum < N:
	sum += sum * 0.01
	i += 1
	sum = int(sum)

print(i)

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

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

while True:
  x = x + x//100 
  year += 1
  if x >= X:break
print(year)

Solution (Python):
import math
X = int(input())
price=100
year=0
while price < X:
  price += math.floor(price*0.01)
  year+=1
print(year)

Solution (Python):
x = int(input())
start = 100
rate = 1.01
cnt = 0
while start < x:
  start = int(start * rate)
  cnt += 1
print(cnt)

Solution (Python):

x = int(input())

deposit = 100
count = 0
while x > deposit:
    deposit += deposit*1//100
    count += 1
    
print(count)

Solution (Python):
import math

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

Solution (Python):



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

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

if __name__ == '__main__':
    main()

Solution (Python):
import math

X = int(input())
yokin = 100
ans = 0
while yokin < X:
    yokin = int(yokin*1.01)
    
    ans += 1

print(ans)

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

from math import floor

x = int(read())
v = 100
for i in range(x):
    v = floor(v * 1.01)
    if v >= x:
        print(i + 1)
        exit()

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

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

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

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

Solution (Python):

X = int(input())
n = 0
m = 100
while m < X:
    n += 1
    m += m//100 

print(n)

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations, combinations, accumulate, count
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop

INF = float('inf')
NIL = - 1


X = int(input())

s = 100
for year in count():
    if s >= X:
        break
    s = s * 101 // 100
print(year)

Solution (Python):
import math
 
def readInt():
	return int(input())
 
def readInts():
	return list(map(int, input().split()))
 
def readChars():
	return input().split()
 
x = readInt()
m = 100
n = 0
 
while 1:
	if m>=x:
		print(n)
		break
	n+=1
	m=math.floor(m*1.01)

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

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

i = 0
a = 100.0
while True:
  a = math.floor(a * 1.01)
  i += 1
  if a>=X:
    break
    
print(i)

Solution (Python):
x = int(input())
t = 0
y = 100
z = 0
while y < x:
    t += 1
    y += y // 100
print(t)

Solution (Python):
inp=input
li=list
iinp=lambda : int(inp())
ent=lambda : map(int,inp().split())
lient=lambda : [int(i) for i in inp().split()]
li0= lambda x: [0 for i in range(x)]
livalor=lambda valor,x: [valor for i in range(x)]
stent=lambda : [i for i in inp()]
filldp=lambda valor,x,y: [[valor for i in range(y)] for i in range(x)]

meta=iinp()
inicio=100
res=1
while True:
    inicio=inicio+int(inicio*0.01)
    if inicio>=meta:
        print(res)
        break
    res=res+1

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

i = 100
count = 0

while (1):
    if i >= n:
        break
    i = int(i * 1.01)
    count +=1

print(count)

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

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

print(ans)

Solution (Python):




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

    p = 100
    step = 0

    while(p < X):
        p += p//100
        step += 1
    
    print(step)

if __name__ == '__main__':
    main()

Solution (Python):
import math

def input_number():
    return int(input())

def input_1line_list(number_of_input):
    return [input() for i in range(number_of_input)]

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




def main():
    x = input_number()
    year = 0
    money = 100
    while money < x:
        money += money//100
        year += 1
    print(year)

if __name__ == '__main__':
    main()

Solution (Python):
import math

X = input()
X = int(X)
s = 100
S = s
i = 1
num = 0
while(S < X):
    S = S * 1.01
    S = math.floor(S)
    num = i
    i += 1
print(num)

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

ans = 0
deposit = 100
while deposit < X:
    ans += 1
    deposit = (deposit * 101) // 100
print(ans)

Solution (Python):
from math import floor,ceil
X = int(input())
cash = 100
count = 0
while cash < X:
    cash=floor(cash*1.01)
    count += 1
print(count)

Solution (Python):
import numpy as np

X = int(input())

N = 0
T = 100
while(T<X):
  T = int(T*1.01)
  N+=1
  
print(N)

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

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

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

Solution (Python):
import math
A=int(input())
c=0
d=100
while(1):
  d=math.floor(d*1.01)
  c+=1
  if d>=A:
    print(c)
    break

Solution (Python):
from math import floor,ceil
X = int(input())
 
p = 100
c = 0
while p < X:
    p=floor(p*1.01)
    c += 1
print(c)

Solution (Python):
import math

paramX = int(input())

balance = 100

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

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

Solution (Python):
from collections import Counter, defaultdict
import sys

sys.setrecursionlimit(10 ** 5 + 10)

from math import factorial
import heapq, bisect
import math
import itertools

import queue
from collections import deque



def main():
    x = int(input())
    now_price = 100
    now_count = 0
    while 1:
        now_price = now_price * 1.01
        now_price = int(now_price)
        now_count += 1
        if now_price >= x:
            break

    print(now_count)






if __name__ == '__main__':
    main()

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

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

Solution (Python):
if __name__ == '__main__':
    n = int(input())
    p = 100
    count = 0

    while p < n:
        p += p // 100
        count += 1

    print(count)

Solution (Python):
x=int(input())
a=100
c=0
while(a<x):
  a=int(a+(a*(1/100)))
  c=c+1
print(c)

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

Solution (Python):
n = int(input())
x = 100
ans = 0
while True:
    x = int(x + (x*0.01))
    ans += 1
    if x >= n:
        print(ans)
        break

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

if __name__ == '__main__':
    main()

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

Solution (Python):
from math import floor,ceil
x = int(input())
c = 0
p = 100
while p<x:
    p = floor(p*1.01)
    c+=1
print(c)

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

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



while sum < X:
    sum += sum // 100
    count += 1


print(count)

Solution (Python):
import math
a=int(input())
t=100
sum=0
while(t<a):
	t=math.floor(t*101/100)
	sum=sum+1
print(sum)

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

Solution (Python):
import math
X=int(input())
T=100
a=0
while X>T:
  T=math.floor(1.01*T)
  a=a+1
print(a)

Solution (Python):
x=int(input())
now=int(100)
for i in range(5000):
    if now>=x:
        print(i)
        exit()
    now=int(now*1.01)

Solution (Python):
import math

def main():
	X = int(input())
	money = 100
	n = 0
	while(money<X):
		n += 1
		money = math.floor(money * 1.01)

	print(n)
	
if __name__ == "__main__":
	main()
	pass

Solution (Python):
X = int(input())
Y = 100
y = 1
while True:
  Y = (Y * 101) // 100
  if Y >= X:
    print(y)
    break
  y += 1

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

Solution (Python):
money = 100
count = 0
goal = int(input())

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

Solution (Python):
X=int(input())
mon=100
i=1
while True:
    mon=int(mon*((1.01)))

    if mon>=X:
        print(i)
        break
    i+=1

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

a = int(100)
b = int()

while a<X:
    a = int(a + a/100)
    b = b + 1
else:
    print(b)

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

Solution (Python):
import math

X=float(input())
Y=100
Z=0
while Y<X:
    Y*=1.01
    Y=math.floor(Y)
    Z+=1
    
print(Z)

Solution (Python):
n=int(input())
now=1
p=100
for i in range(1,1000008):
	p=p*(101)
	p=p/100
	if(p>=n):
		print(i)
		break

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

a = 100
r = 0.01
n = 0


while True:
    b = a * 1.01
    c = int(b)
    if c  >= X:
        break
    n+=1
    a = c
print(n+1)

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

Solution (Python):
import math

N = int(input())


sum = 100
i = 0





while sum < N:
	sum += sum * 0.01
	i += 1
	sum = math.floor(sum)

print(i)

Solution (Python):


def over(X, start=100):
    i = 0
    current = start
    while True:
        i += 1
        current += current // 100
        if current >= X:
            return i

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

    result = over(X, 100)

    print(result)
   


if __name__ == '__main__':
    main()

Solution (Python):
import math
x = int(input())
base = 100
money = []
while True:
  base += math.floor(base * 0.01)
  money.append(1)
  if math.floor(base) >= x:
    break;
print(len(money))

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

s = 100 
for i in range(1,5000):
    s *=1.01
    s = math.floor(s)
    if s >=n:
        print(i)
        break

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

money = 100
year = 0

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

Solution (Python):
x=int(input())
ok=10**5
ng=0
while ok-ng>1:
    mid=(ok+ng)//2
    cnt=100
    for _ in range(mid):
        cnt*=1.01
        cnt=int(cnt)
    if cnt>=x:
        ok=mid
    else:
        ng=mid
print(ok)

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

Solution (Python):
import math
import sys

def main():
    x = int(input())
    ai = 100
    y=1
    n = 0
    
    for i in range(x):
        ai = math.floor(ai*1.01)
        n += 1
        if(ai>x-1):
            print(n)            
            break
            sys.exit()
    
if __name__ == "__main__":
    main()

Solution (Python):
x = int(input())
timeCounter = 0
finalAmount = 100

while (finalAmount < x):
    simpleInterest = finalAmount // 100
    finalAmount += simpleInterest
    timeCounter += 1
print(timeCounter)

Solution (Python):
import math

X = int(input())
Money = 100

cnt = 0
while (Money < X):
    Money = Money * 1.01
    Money = math.floor(Money)
    cnt = cnt + 1

print(cnt)

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

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

Solution (Python):

x=int(input())

import math 

count=100
for nn in range (4000):
    count=(math.floor(count+(count*0.01)))
    if count>=x:
        print(nn+1)
        break

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

s = 100
count = 0

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

print(count)

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

Solution (Python):
num = int(input())
year = 0
cash = 100
while(True):
  cash += int(cash/100)
  year+=1
  if(num <= cash):
    print(year)
    break

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

wk =100
i=0
while x >wk:
    wk += int(wk*0.01)
    i+=1
print(i)

Solution (Python):
import math

x = int(input())
cnt = 0
money = 100

while 1:
  money *= 1.01
  cnt += 1
  money = math.floor(money)
  if money >= x:
    break

print(cnt)

Solution (Python):
import math

x = int(input())

total = 100
rate = 1.01
years = 0
while total < x:
    total = int(total*rate)
    years += 1

print(years)

Solution (Python):
x = int(input())
timeCounter = 0
finalAmount = 100

while (finalAmount < x):
    simpleInterest = finalAmount // 100
    finalAmount += simpleInterest
    timeCounter += 1
print(timeCounter)

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

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

year = 0
percent = 1.01
yokin = 100

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

print(year)

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

while now < X:
    now += int(now /100)
    count += 1
print(count)

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

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

Solution (Python):
import math

X=int(input())

money = 100
ans = 0

while money < X:
    money += math.floor(money * 0.01)
    ans += 1

print(ans)

Solution (Python):
x = int(input())
n,ans = 100,0
while True:
	if n >= x:
		break
	n = n * 101 // 100
	ans += 1
print(ans)

Solution (Python):
from math import log,floor
x = int(input())
yokin = 100
i = 0
while yokin < x:
    yokin = floor(yokin*1.01)
    i += 1
print(i)

Solution (Python):
X = int(input())
ans = 0
dep = 100
while X > dep:
  dep += int(dep * 0.01)
  ans += 1
print(ans)

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

money = 100
year = 0

while money < X:
	money += int(money*0.01)
	year += 1

else:
	print(year)

Solution (Python):
import sys
sys.setrecursionlimit(10**6)

X = int(input())

temp_list = [0 for i in range(3761)]


def solve(n):
    if n == 0:
        return 100
    if temp_list[n] != 0:
        return temp_list[n]
    temp = solve(n - 1)
    a = temp + int(temp * 0.01)
    temp_list[n] = a
    return a


for i in range(3761):
    if solve(i) >= X:
        print(i)
        exit()

Solution (Python):
import math


x_deposit = int(input())



deposit = 100

interest = 1.01

past_deposit = []

while x_deposit > deposit:
    deposit = deposit * interest
    deposit = math.floor(deposit)
    past_deposit.append(deposit)





years = len(past_deposit)

print(years)

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

Solution (Python):
import math

def main():
    X = input()
    X = int(X)
    output = 100
    year = 0
    while output < X:
        output = int(output * 1.01)
        math.floor(output)
        year += 1

    print(year)

if __name__ == "__main__":
    main()

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

a=100
k=0
y=0
for i in range(10**18):
  y=y+1
  
  k = a//100
  a=a+k
  
  if(a>=x):break

print(y)

Solution (Python):
import math
X = int((input() .split())[0])
Yokin = 100
Nen = 0

while X > Yokin:
	Yokin = math.floor(Yokin * 1.01)
	Nen = Nen + 1

print( Nen )

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

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

loop = [0]

en = 100
year = 0
for i in loop:
    en = int(math.floor(en*1.01))
    year +=1
    loop.append(i+1)

    if X <= en:
        break
    
print(str(year))

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

for i in range(3760):
  B = int(B*1.01)
  if X <= B:
    print(i+1)
    break

Solution (Python):
def B():
    n = int(input())
    m = 100
    i = 0
    while True:
        if n <= m:
            break
        else:
            m += int(m*0.01)
            i += 1
    print(i)
B()

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

ans= 0
m = 100
while(True):
    m *= 1.01
    m=int(m)
    ans += 1
    if m >= X:
        print(ans)
        break

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

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

A = 100
r = 0.01

i = 0
while A < X:
  A = int(A*(1+r))
  i = i + 1

print(i)

Solution (Python):
import math
x = int(input())
s = 100
for i in range(3760):
    s=math.floor(s*1.01)
    if s>=x:
        print(i+1)
        break

Solution (Python):
import math

x = int(input())
task = 100
count = 0

while task < x:
    task = math.floor(task * 1.01)
    
    count += 1

print(count)

Solution (Python):
x = int(input())
a = 100
for i in range(1, 3770):
    a *= 1.01
    a = int(a)
    if a >= x:
        print(i)
        exit()

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

Solution (Python):

yo = 100
c = 0
X = int(input())

while( yo < X ):
    c += 1
    ri = int(yo/100)
    yo += ri
print(c);

Solution (Python):
from math import log,floor
n=int(input())
"""
num=log(n/100)
den=log(1.01)
ans=num/den
print(int(ans))
"""
i=0
p=100
while 1:
	inter=p/100
	p+=inter
	p=int(p)
	i+=1
	if p>=n:
		print(i)
		break

Solution (Python):
import math
x=int(input())
y=100
for i in range(1,4000):
	y=math.floor(y*1.01)
	if y>=x:
		print(i)
		break

Solution (Python):
import decimal
X = int(input())
i = 0
K = 100

while K < X:
  i = i + 1
  K_ = decimal.Decimal(str(K*1.01))
  K = int(K_.quantize(decimal.Decimal('0'), rounding=decimal.ROUND_FLOOR))
  
print(i)

Solution (Python):
X = int(input())
money = 100
year = 0
while money < X :
    fraction = money*0.01
    if fraction >= 1 :
        money += int(fraction)
        year += 1
print(year)

Solution (Python):
X = input().strip()
X_int = int(X)

count = 0
amount = 100
while X_int > amount:
	amount = int(amount * 1.01)
	count += 1

print(count)

Solution (Python):
import math 
x = int(input())
yokin=100
c = 0

while yokin < x:
  yokin*=1.01
  yokin = math.floor(yokin)
  c+=1

print(c)

Solution (Python):
import math

S = int(input())
h, j = 100, 1
for i in range(1, 100000):
    h += int(h*0.01)
    if S <= h:
        print(i)
        exit(0)

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

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

Solution (Python):
from math import ceil
n=int(input())
x=100
ct=0
while(x<n):
    if n<100+x:
        ct+=ceil((n-x)/(x//100))
        break
    else:
        ct+=ceil((100-x%100)/(x//100))
        x+=ceil((100-x%100)/(x//100))*(x//100)
        
print(ct)

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

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

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

print(count)

Solution (Python):
from sys import stdin

X = int(stdin.readline())
Y = 100

count = 1
while True:
  Y += int(Y*0.01)
  if Y >= X:
    print(count)
    break
  else:
    count += 1

Solution (Python):
n = int(input())
count = 0
p =100
while(1):
    p += int(p*0.01)
    count += 1
    if p >= n:
        print(count)
        break

Solution (Python):
def interest(a):
  n =100
  count = 0
  while n < a:
    n = int(n * 1.01)
    count += 1
  return count
x = int(input())
year = interest(x)
print(year)

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

count = 0
x = 100

while True:
  x = int(x + x * 0.01)
  count = count + 1
  
  if x >= money:
    break
    
print(count)

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 6)

int1 = lambda x: int(x) - 1
def II(): return int(input())

def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())

def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

INF = float('inf')
from math import floor
def solve():
    yen = 100
    x = II()
    for i in range(5000):
        yen = floor(yen * 1.01)
        if yen >= x:
            print(i+1)
            break

if __name__ == '__main__':
    solve()

Solution (Python):
import math

X = int(input())

yokin = 100
count = 0

for i in range(10**18):
  rishi = math.floor(yokin * 0.01)
  yokin += rishi
  count += 1
  if yokin >= X:
    break
print(count)

Solution (Python):
x=int(input())
cnt=0
a=100

while a<x:
  cnt =cnt+1
  a=a*101//100
print(cnt)

Solution (Python):
def compound_interest(n, r, t): 
    for i in range(t):
        n=n+int((n*r)/100)
    return n

x=int(input())
for i in range (1,100000):
    ci=compound_interest(100, 1, i)
    if(ci>=x):
        print(i)
        break

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

Solution (Python):
import math

X = int(input())
money = 100
cnt = 0


while money < X :
    cnt = cnt + 1
    money = math.floor(money * 1.01)
print(cnt)