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



Sample input:
103


Sample output:
3

Submission status: Accepted

Solution code:
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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

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

print(c)

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

Solution code:
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(x,ct)
print(ct)

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

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

print(count)

Submission status: Accepted

Solution code:
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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
money = int(input())

count = 0
x = 100

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 6)
# input = sys.stdin.readline    ####
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()

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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


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

Submission status: Accepted

Solution code:
x=100
t=0
mokuhyo = int(input())
while x < mokuhyo:
  x+=x//100
  t+=1
print(t)

Submission status: Accepted

Solution code:
X = int(input())
M = 100
Y = 0
Nenri = 1.01
while X > M:
    M = int(M * Nenri)
    Y += 1

print(Y)

Submission status: Accepted

Solution code:
import math

X = int(input())

a = 100

c = 0
while(True):
    a = math.floor(1.01 * a)
    c += 1
    if a >= X:
        print(c)
        exit()

Submission status: Accepted

Solution code:
def main():
    x=int(input())
    ans = 0
    t=100
    while t<x:
        t+=(t//100)
        ans+=1

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
X = int(input())

a = 100

for i in range(1,10**18):
    a += int(a*0.01)
    if a >= X:
        print(i)
        break

Submission status: Accepted

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

i = 0
a = 100

while  x >= a:
    a = int(a*(1.01))
    i += 1
    if x == a:
        break
    
print(i)

Submission status: Accepted

Solution code:
X=int(input())
a=100
for i in range(1,10**18):
  s=int(0.01*a)
  a+=s
  if X<=a:
    print(i)
    break

Submission status: Accepted

Solution code:
from math import floor

a = int(input())
n = 100
result = 0

while True:
    n = floor(n) * 1.01
    result += 1
    if n >= a:
        break

print(result)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
from heapq import heappop, heappush

from decimal import *

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

##### 累乗 #####
# pow(x, y, z) -> x**y % z

##### 割り算の切り上げ #####
# tmp = -(-4 // 3)

##### dict の for文 #####
# for k, v in d.items():
#     print(k, v)

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]

inf = float('inf')
mod = 1000000007

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-

def main():
	X = inputInt()

	ans = 0
	yen = 100

	if yen >= X:
		print("0")
		sys.exit()

	while True:
		if yen >= X:
			break

		ans += 1
		yen = yen + (yen // 100)

	print(ans)

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
    r = min(r, n-r)
    res = 1
    for i in range(r):
        res = res * (n - i) * modinv(i+1, mod) % mod
    return res

# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)

def egcd(a, b):
    if a == 0:
        return b, 0, 1
    else:
        g, y, x = egcd(b % a, a)
        return g, x - (b // a) * y, y

# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
	# comb = Combination(n+r-1, mod)
	# return comb(n+r-1, r)
    return combination(n+r-1, r, mod)


class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  # 10
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        # 階乗のリストと階乗のmod逆元のリストを返す O(n)
        # self.make_modinv_list()が先に実行されている必要がある
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        # 0からnまでのmod逆元のリストを返す O(n)
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# dfs のサンプル
def dfs(graph,parent,counter,edge):
    stk = []
    stk.append(edge)
    while len(stk) > 0:
        p = stk.pop()
        for e in graph[p]:
            if parent[p] == e:
                continue
            else:
                parent[e] = p
                counter[e] += counter[p]
                stk.append(e)

if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
N = int(input())
m = 100

for i in range(1,100000000+1):
    m += m * 0.01
    m = int(m)
    #print(i)
   #	print(m)
    if m >= N:
      print(i)
      break

Submission status: Accepted

Solution code:
import math
X=int(input())
i=1
ans=100
while math.floor(ans*(1+0.01))<X:
    ans=math.floor(ans*(1+0.01))
    i+=1
print(i)

Submission status: Accepted

Solution code:
X = int(input())
r = 0.01
s = 100
n = X
i = 0
while s < X:
	s = int(s * (1 + r))
	i = i + 1
print(i)

Submission status: Accepted

Solution code:
X = int(input())  #数字

import math
money = 100
cou = 0

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

print(cou)

Submission status: Accepted

Solution code:
import math
import sys
X=int(input())
money=int()
money=100
i=1
while X<=10**18:
    money=math.floor(money*1.01)
    if money>=X:
        print(i)
        sys.exit()
    else:
        i=i+1

Submission status: Accepted

Solution code:
import math
X = int(input())
money = float(100)
year = 0
while 1:
    if money >= X: break
    money = math.floor(money+money*0.01)
    year += 1
print(year)

Submission status: Accepted

Solution code:
from copy import copy, deepcopy
from collections import Counter
from math import sqrt, floor, log

MOD = 10**9 + 7


X = int(input())

ans = 0
tmp = 100
while tmp < X:
    tmp = floor(tmp * 1.01)
    ans += 1

print(ans)

Submission status: Accepted

Solution code:
K = int(input())
i = 0
s = 100
while True:
  i = i + 1
  s = int(s * (1 + 0.01))
  
  if (K <= s):
    print(i)
    break

Submission status: Accepted

Solution code:
import math
X = int(input())
i = 2
Y = 100

for i in range(100000000000000000):
    Y = math.floor(Y*1.01)
    if Y >= X:
        print(i+1)
        break

Submission status: Accepted

Solution code:
import math
n = int(input())
s=100

for i in range(1,3761):
  s=math.floor(s*0.01+s)
  if s>=n:
    print(i)
    break

Submission status: Accepted

Solution code:
x = int(input())
tmp = 100
year = 0
while tmp < x:
  year += 1
  tmp = (tmp * 101) // 100

print(year)

Submission status: Accepted

Solution code:
from decimal import *
x = int(input())
a = 100
n=1
while (True):
    if int(a * 1.01) >= x:
        print(n)
        exit()
    else:
        a=int(a*1.01)
        n+=1

Submission status: Accepted

Solution code:
X = int(input())
B = 100
i = 0
while B < X:
    B += int(B * 0.01)
    i += 1
print(i)

Submission status: Accepted

Solution code:
import math
x = int(input())
ans = x
count = 0

while ans != 100:
  ans = math.ceil(ans / 1.01)
  count += 1
  
print(count)

Submission status: Accepted

Solution code:
import math
x = int(input())
cur = 100
for i in range(1, 3761):
	cur = cur + math.floor((cur / 100))
	if (cur >= x):
		print(i)
		break

Submission status: Accepted

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

Submission status: Accepted

Solution code:

x = int(input())


now = 100
count = 0
while(now<x):
    now += now//100
    count+=1
print(count)

Submission status: Accepted

Solution code:
x = int(input())
bank = 100

count = 0
while x > bank:
    bank = int(bank * 1.01)
    count += 1

print(count)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(300000)

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')


X = I()
d = 100
for i in range(1, 3761):
    d = int(d * 1.01)
    if d >= X:
        print(i)
        exit(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
begin = 100
ans = 0
while True:
    if begin < x:
        begin = int(begin * 1.01)
        ans += 1
    elif begin >= x:
        print(ans)
        break

Submission status: Accepted

Solution code:
k = int(input())
i = 100
cnt = 0
while i < k:
    p = float(i) 
    p = p * 1.01
    i = int(p)
    cnt = cnt + 1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from decimal import Decimal

x = int(input())

s = 100
r = 0.01
i = 0
ans = 0
while not(s >= x):
    s = int(s * (1 + r))
    ans = i
    i += 1

print(ans + 1)

Submission status: Accepted

Solution code:
N = int(input())
n=0
k=0.01
sum=100
while N > sum:
    add=sum*0.01
    sum=sum+int(add)
    n=n+1
print(n)

Submission status: Accepted

Solution code:
import math

X = int(input())
temp = 100
i = 0

while(temp < X):
    ann_balance = math.floor(temp / 100)
    temp = temp + ann_balance
    i += 1

print(i)

Submission status: Accepted

Solution code:
from decimal import *
x=int(input())
c=0
m=100
while m<x:
  m=Decimal(str(m))*Decimal('1.01')
  m=int(m)
  c+=1
  
print(c)

Submission status: Accepted

Solution code:
x=int(input())
d=100
con=0
while x>d:
    con+=1
    d=int(d*1.01)

print(con)

Submission status: Accepted

Solution code:
import math

x = int(input())

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

print(year)

Submission status: Accepted

Solution code:
X=int(input())
sum=0
n=100
for i in range(10000):
    if n<X:
        n=n*1.01//1
        sum += 1
print(sum)

Submission status: Accepted

Solution code:
x=int(input())

sum=0
y=100
for i in range(10000):
  y=int(y*1.01)
  if y<x:
    sum+=1
  else:
    sum=sum
print(sum+1)

Submission status: Accepted

Solution code:
import math

X = int(input())
temp = 100
i = 0

while(temp < X):
    ann_balance = math.floor(temp / 100)
    temp = temp + ann_balance
    i += 1

print(i)

Submission status: Accepted

Solution code:
x = int(input())

ret = 100
ans = 0

while True:
    ret = ret * 101 // 100
    ans += 1
    if x <= ret:
        print(ans)
        break

Submission status: Accepted

Solution code:

def main():
    X = int(input())
    bank_money = 100
    i = 1
    while True:
        bank_money = int(bank_money * 1.01)
        if bank_money >= X:
            out = i
            break
        i += 1
    print(out)
main()

Submission status: Accepted

Solution code:
from math import floor
x=int(input())
p=100
r=0.01

for i in range(1,3760+1):
    c=floor(p*(1.01)**1)
    if c<x:
        p+=c-p
    else:
        break
print(i)

Submission status: Accepted

Solution code:
X = int(input())

years = 0
money = 100
RISI = 0.01
while money < X:
	money += int(money * RISI)
	years += 1
print(years)

Submission status: Accepted

Solution code:
import math
a=int(input())
b=100
ans=0
while(1):
  b += math.floor(b*0.01)
  ans +=1
  if(b>=a):
    break



print(ans)

Submission status: Accepted

Solution code:
x = int(input())
a = 100
y = 0
while x > a:
    a = int(a*101/100)
    y = y+1
 
print(y)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

x = int(input())

res = 0
c = 100


while c < x:
    c = (c*101)//100
    res += 1

print(res)

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.readline

X = int(readline())

res = 100
for i in range(1, 10000):
    res = res*101//100
    if res >= X:
        break
print(i)

Submission status: Accepted

Solution code:
import math
a = int(input())
 
b = 100
ans = 0

while a > b:
    b = math.floor(b*1.01)
    ans += 1
 
print(ans)

Submission status: Accepted

Solution code:
import math
X = int(input())
count = 0
x_value = 100

while x_value < X:
  x_value += math.floor(x_value * 0.01)
  count += 1
  

print(count)

Submission status: Accepted

Solution code:
import math

x = int(input())
m = 100
i = 0.01
y = 0
flag = True
while flag:
    m = math.floor(m*(1+i))
    y += 1
    if m >= x:
        break
print(y)

Submission status: Accepted

Solution code:
counter = 0
x = int(input())
yokin = 100

while x > yokin:
  yokin = int(yokin * 1.01)
  counter += 1

print (counter)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math

a = int(input())
x = 100
y = 1.01
count  = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

while True:
    if (s >= x):
        break
    s = s+(math.floor(s*0.01))
    cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
x = int(input())
depo = 100
y = 0

while depo < x:
    depo = int(depo * 1.01)
    y += 1

print(y)

Submission status: Accepted

Solution code:
def main(p):
    k=100
    a=0
    while k<p:
        k=(k+k*0.01)//1
        a+=1
    print(a)
p=int(input())   
main(p)

Submission status: Accepted

Solution code:
X = int(input())
yen = 100
i = 0

def rishi(yen):
	return int(yen * 1.01)

while 1:
	i += 1
	yen = rishi(yen)
	if X <= yen:
		break

print(i)

Submission status: Accepted

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

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

print(n)

Submission status: Accepted

Solution code:
x=int(input())
a=100
y=0
while x>a:
    a=int(a*1.01)
    y+=1
print(y)

Submission status: Accepted

Solution code:
X = int(input())

money = 100
count = 0
while money < X:
    count += 1
    money = (money * 1.01) // 1

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    X=int(input())
    P=100
    countYears=0
    while(True):
        A=P+P*(0.01)
        A=int(A)
        countYears+=1
        P=A
        if A>=X:
            break
    print(countYears)
if __name__=='__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
X = int(input())
d = 100
year = 0
while True:
    year += 1
    if d+math.floor(d*0.01) >= X:
        print(year)
        exit()
    else:
        d += math.floor(d*0.01)

Submission status: Accepted

Solution code:
import math
X = int(input())
zankin = 100
for i in range(1,10**18):
  zankin += math.floor(zankin*0.01)
  if zankin >=X:
    print(i)
    break

Submission status: Accepted

Solution code:
import math
x = int(input())
r = 0
i = 100
while(i < x):
    i = int(i * 1.01)
    r += 1
print(r)

Submission status: Accepted

Solution code:
import math
import sys

stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))
mod = 10**9 + 7 
sys.setrecursionlimit(1000010)

X = ni()
S = 100
year = 0
while True:
    if S >= X:
        print(year)
        exit(0)
    S = (S * 101) // 100
    year = year +1

Submission status: Accepted

Solution code:
import math

x = int(input())

money=100


for year in range(1,100000):
    money = math.floor(money*1.01)
    if money>=x:
        print(year)
        break

Submission status: Accepted

Solution code:
import math
import sys

X=int(input())
i=0
y= 100

if X==y:
	print(i)
	sys.exit()

while X > y:
	i=i+1
	y=y*1.01
	y=math.floor(y)
	if X==y:
		print(i)
		sys.exit()

print(i)

Submission status: Accepted

Solution code:
import math
x = int(input())
m = x-100
ans = 100
i = 0
while(ans<x):
    ans += math.floor(ans*0.01)
    i+=1
print(i)

Submission status: Accepted

Solution code:
x = int(input())
m = 100
c = 0

while True:
    if m >= x:
        break
    c += 1
    m = m + int(m*0.01)

print(c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

X = int(input())
money = 100
ret = 0
while X > money :
  money = int(money * 1.01)
  ret += 1
print(ret)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
s = 100 * 1.01
c = 1
while 1:
    if s >= x:
        print(c)
        break
    c += 1
    s *= 1.01
    s //= 1

Submission status: Accepted

Solution code:
X = int(input())

cnt = 0
total = 100

while True:
    cnt += 1
    total = (total*101)//100

    if total>=X:
        break

print(cnt)

Submission status: Accepted

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

num =  0
s = 100
while True :
    num += 1
    s += math.floor(s * 0.01)
    if  s >= x:
        break
    else:
        continue
print(num)

Submission status: Accepted

Solution code:
x = int(input())

money = 100
i = 1

while money < x:
	money = int(money * 1.01)
	if money >= x:
		print(i)
	else:
		i = i+1

Submission status: Accepted

Solution code:
a=int(input())
m=100
c=0
for i in range(4000):
  m=int(m*1.01)
  c=c+1
  if m >= a:
    break
print(c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())
bank = 100
result = 0

import math
import decimal

while (True):
    # print("bank = "+str(bank))
    if(bank >= X):
        break
    else:
        tmp = str(bank*0.01)
        tmp = tmp[:tmp.find('.')]
        bank = bank + int(tmp)
        result = result+1

print(result)

Submission status: Accepted

Solution code:
import math
X = int(input())
money = 100

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

Submission status: Accepted

Solution code:
import math

X = int(input())
N = 1
Year = 0
money = 100

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

print(Year)

Submission status: Accepted

Solution code:
x = int(input())
cnt = 0
m = 100

while m < x:
  cnt += 1
  m = int(m*1.01)

print(cnt)

Submission status: Accepted

Solution code:
n = int(input())
poket = 100
count = 0

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

Submission status: Accepted

Solution code:
import math
X = int(input())
v= math.log(X/100,1.01)
original = 100
tmp = original
Ny = 1 
while(1):
    tmp = tmp+tmp//100
    if tmp>=X:
        break
    else:
        Ny+=1

print(Ny)
# print(v)

Submission status: Accepted

Solution code:
import math
import sys
input = lambda: sys.stdin.readline().strip()

def main():
    X = int(input())
    n = 100
    for i in range(1,4000):
        n = int(n*1.01)
        if n>=X:
            break
    print(i)

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

x = int(input())
n = 100
for i in range(1, 100000):
    n = int(n * 1.01)
    if n >= x:
        print(i)
        exit()

Submission status: Accepted

Solution code:
x=int(input())

x0=100
n=10**6
for i in range(n):
    x0=int(x0*1.01)
    if x0>=x:
        break
print(i+1)

Submission status: Accepted

Solution code:
x = int(input())
a = 100
count = 0

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

print(count)

Submission status: Accepted

Solution code:
X = int(input())
Y = 100
i = 0
while(1):
    Y = int(Y * 1.01)

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

Submission status: Accepted

Solution code:
import math
x = int(input())
m = 100
ans = 0
while m < x:
    m = math.floor(m + m * 0.01)
    ans += 1
    # print(ans, m, end=" ")
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
X = int(input())
b = 100
ans = 0
while b < X:
    b += int(b*0.01)
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
X = int(input())
n = 0
m = 100
while m < X:
    m += int(str(m)[:-2])
    n += 1
print(n)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math

k = int(input())


# a, b = map(int, input().split())

n = 1
a=100
while a < k:
    a= math.floor(a*1.01)
    n+=1
if k<=100:
    print(n)
else:
    print(n-1)

Submission status: Accepted

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

year = 0
money = 100
while True:
    year += 1
    money = math.floor(money * 1.01)
    if money >= X:
        break

print(year)

Submission status: Accepted

Solution code:
import numpy as np
X = int(input())
zandaka = 100
for a in range(100000):
    zandaka = np.floor(zandaka * 1.01)
    if zandaka >= X:
        print(a+1)
        break

Submission status: Accepted

Solution code:
import math
from decimal import Decimal

def next_year_depo(x):
    return (x * Decimal(1.01)).quantize(Decimal('1.'), rounding='ROUND_DOWN')

depo = Decimal(100)
target = int(input())

ans = math.floor(math.log(target/100, 1.01))
for _ in range(ans):
    depo = next_year_depo(depo)

while depo < Decimal(target):
    depo = next_year_depo(depo)
    ans +=1
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
x = int(input())
money = 100
year = 0
while money < x:
    money = int(money * 1.01)
    year += 1
print(year)

Submission status: Accepted

Solution code:
x=int(input())
a=100
b=0
import math
while a<x:
    a=math.floor(a*1.01)
    b+=1
print(b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

a = 100
x = int(input())

for i in range(x):
    if a < x:
        a = math.floor(1.01 * a)
    else:
        print(i)
        break

Submission status: Accepted

Solution code:
x = int(input())

base = 100

count = 0

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

print(count)

Submission status: Accepted

Solution code:
import math

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

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

Submission status: Accepted

Solution code:
X=int(input())
deposit=100
year=0
while(deposit<X):
  deposit=int(deposit/100)+deposit
  year=year+1

print(year)

Submission status: Accepted

Solution code:

import math

deposit = 100

# target は 101以上10^18以下
target = int(input())

for n in range(1, 50000000):
    deposit = math.floor(deposit * 1.01)
    #print(deposit)
    if (deposit >= target):
        print(n)
        break

Submission status: Accepted

Solution code:
X = int(input())

v = 100
y = 0
while True:
    v *= 1.0100000
    v   = int(v)
    y += 1
    if v >= X:
        break
        
print(y)

Submission status: Accepted

Solution code:
import math
account = 100
goal = int(input())
count = 0

while True:
  count += 1
  account = math.floor(account * 1.01)
  if account >= goal:
  	break
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
x = int(input().strip())
a = 0
b = 100
c = 0
count = 0
list = []
while a ==0:
    list.append(b)
    b = math.floor(b*1.01)
    count = count + 1
    if b >= x:
        print(count)
        break

Submission status: Accepted

Solution code:
x = int(input())
y = 100
n = 0
while True:
  if y < x:
    y += int(0.01 * y)
    n += 1
  else:
    print(n)
    break

Submission status: Accepted

Solution code:
a = int(input())
b = 100
count = 0
while True:
  b = int(b + b*(0.01))
  count += 1
  if b >= a:
    break
print(count)