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:
#C,D = map(int,input().split())
N=int(input())
#A = list(map(int,input().split()))
#S=str(input())
flag=True
A=100
c=0
while flag==True:
    c+=1
    A+=int(A*0.01)

    if A>=N:
        print(c)
        flag=False

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X=int(input())

import math

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

print(year)

Submission status: Accepted

Solution code:
x = int(input())

money = 100
year = 0
while(money < x):
    money += int(money * 0.01)
    year += 1

print(year)

Submission status: Accepted

Solution code:
N = int(input())

count = 0
base = 100
while base < N:
    base *= 1.01
    base = int(base)
    count += 1
    
print(count)

Submission status: Accepted

Solution code:
# coding: utf-8


def solve(*args: str) -> str:
    x = int(args[0])

    ret = 0
    p = 100
    while p < x:
        p = int(p*1.01)
        ret += 1

    return str(ret)


if __name__ == "__main__":
    print(solve(*(open(0).read().splitlines())))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


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


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    X = int(next(tokens))  # type: int
    solve(X)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
X = int(input())

N = 100
p = 0
while N < X:
  p += 1
  N = N * 1.01
  N = N // 1
  
print(p)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


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


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    X = int(next(tokens))  # type: int
    solve(X)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def n0():return int(input())
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(input()) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]

x=n0()
y=100

c=0
while y<x:
    y=int(y*1.01)
    c+=1
print(c)

Submission status: Accepted

Solution code:
x = int(input())
cnt = 0
mon = 100
while True:
    if mon >= x:
        print(cnt)
        exit()
    cnt += 1
    mon *= 1.01
    mon = int(mon)

Submission status: Accepted

Solution code:

x = int(input())

a = 100

ans = 0

while True:
  a += int(a*(0.01))
  ans += 1
  if a >= x:
    break

print(ans)

Submission status: Accepted

Solution code:
import sys

x = int(input())

y = 100
result = 0
while y < x:
	interest = y // 100
	y = y + interest
	result += 1

print(result)

Submission status: Accepted

Solution code:
S = 100
X = int(input())
cnt = 1
while(S + S //100 < X):
    S = S + S//100
    cnt+=1
print(cnt)

Submission status: Accepted

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

while x<n:
    x*=1.01
    x=int(x)
    c+=1
    #print(x)

print(c)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
x=int(input())
total=100
import math
for i in range(10**5):
    total*=1.01
    total=math.floor(total)
    if total>=x:
        print(i+1)
        exit()

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

x=INT()
k=100
n=0
while True:
    if k>=x:
       print(n)
       exit()
    k=int(k*1.01)
    n+=1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

c = 100

for i in range(1,4000):
  c = int( c * 1.01 )
  if c >= X:
    print(i)
    break

Submission status: Accepted

Solution code:
X = int(input())

v = 100

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# import sys
# import math #sqrt,gcd,pi
# import decimal
# import queue # queue
# import bisect
# import heapq # priolity-queue
# import time
# from itertools import product,permutations,\
#     combinations,combinations_with_replacement
# 重複あり順列、順列、組み合わせ、重複あり組み合わせ
# import collections # deque
# from operator import itemgetter,mul
# from fractions import Fraction
# from functools import reduce

mod = int(1e9+7)
INF = 1<<29
lINF = 1<<35

def readInt():
    return list(map(int,input().split()))

def main():
    x = int(input())
    g = 100
    ans = 0
    while g<x:
        g = int(g * 1.01)
        ans += 1
    print(ans)
    return

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
X = int(input())
cnt = 0
val = 100
while True:
    val = int(val * 1.01)
    cnt += 1
    if X <= val:
        break
print(cnt)

Submission status: Accepted

Solution code:
# s = input()
x = int(input())
# a,b = map(int, input().split())
# a = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
X=int(input())
cur=100

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

Submission status: Accepted

Solution code:
X = int(input())
A = 100
i = 1
while True:
  A = int(A*1.01)
  if A >= X:
    print(i)
    exit()
  i += 1

Submission status: Accepted

Solution code:
X = int(input())


ans = 100
for i in range(1,1000000):
	ans *= 1.01
	ans = int(ans)
	if ans >=X:
		print(i)
		exit()

Submission status: Accepted

Solution code:
import math

x = int(input())
yen = 100

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
cnt = 0
val = 100
import math
while True:
    cnt += 1
    val = math.floor(float(val) * 1.01)
    if val >= x:
        break
print(cnt)

Submission status: Accepted

Solution code:
import math
X = int(input())
money = 100
y = 0
while money < X:
  y += 1
  money = math.floor(money*101/100)
print(y)

Submission status: Accepted

Solution code:
import math

X = int(input())
ans = 0
cur = 100
while True:
    if cur >= X:
        print(ans)
        break
    else:
        ans += 1
        cur = math.floor(cur * 1.01)

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

ans=0
while x>money:
    money=int(money*1.01)
    ans+=1
print(ans)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**9)

X = int(input())
now = 100
ans = 0
while(now < X):
    ans += 1
    now *= 101
    now //= 100

print(ans)

Submission status: Accepted

Solution code:
X = int(input())
A = 100
ans = 0
while(True):
    A = int(A * 1.01)
    ans += 1
    if A >= X:
        break
print(ans)

Submission status: Accepted

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

    num = 100
    ans = 0
    while num < X:
        num = int(num * 1.01)
        ans += 1
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

print(ctr)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(X: int):
    y = 100
    ans = 0
    while y < X:
        y = int(y * 1.01)
        ans += 1
    print(ans)


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    X = int(next(tokens))  # type: int
    solve(X)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
	k = int(input())
	start = 100
	ans = 0
	while start < k:
		start = int(start * 1.01)
		ans += 1
	print(ans)


if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
n=int(input())
#a,b=map(int,input().split())
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]

m=0
a=100
while a<n:
    a=a*1.01//1
    m+=1
print(m)

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    if len(x) == 0:
        return []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def pow_k(x, n):
    ans = 1
    while n:
        if n % 2:
            ans *= x
        x *= x
        n >>= 1
    return ans

"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

n = onem()

po = 100
co = 0
while True:
    if po >= n:
        break
    co += 1
    po += po//100

print(co)

Submission status: Accepted

Solution code:

X=int(input())
yen=100
for i in range(1,3761):
    yen=int(yen*1.01)
    if yen>=X:
        print(i)
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

A = 100
res = 0
while A < X:
    A += int(A * 0.01)
    res += 1

print(res)

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

Solution code:
from itertools import count
from math import floor

X = int(input())

c = 100
for y in count():
    if c >= X:
        print(y)
        break
    c *= 1.01
    c = floor(c)

Submission status: Accepted

Solution code:
X = int(input())
money = 100
res = 0

while money < X:
    res += 1
    money += (money * 0.01) // 1

print(res)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X, = [int(x) for x in input().split()]

balance = 100
i = 0
while balance < X:
    balance = int(1.01 * balance)
    i += 1
print(i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import sys
sys.setrecursionlimit(10**9)
X = int(input())
A = 100
i = 0
while A < X:
    A = math.floor(A*1.01)
    i+=1

print(i)

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

K = 100
year = 0
while K < N:
    K = K*101//100
    year += 1
print(year)

Submission status: Accepted

Solution code:
import sys

x = int(input())

ans = 0
num = 100
while True:
	num *= 1.01
	num = num // 1
	ans += 1
	if num >= x:
		print(ans)
		break

Submission status: Accepted

Solution code:
x = int(input())
count = 0
y = 100
while True:
    y*=1.01
    y = int(y)
    count+=1
    if y>=x:
        print(count)
        exit()

Submission status: Accepted

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

while k < x:
  ans += 1
  k = math.floor(k * 101/100)
print(ans)

Submission status: Accepted

Solution code:
X = int(input())

m = 100
count = 0
while m < X:
    m *= 1.01
    m = int(m)
    count += 1

print(count)

Submission status: Accepted

Solution code:
from sys import stdin

def main():

    input = stdin.readline

    X = int(input())

    A = 100

    ans = 0

    while True:
        A = A + int(A * 0.01)
        ans += 1
        if X <= A:
            print(ans)
            return 0

if __name__ == "__main__":
    main()

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate, product
import sys
import bisect
import string
import math
import time


def I(): return int(input())


def S(): return input()


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


def MS(): return map(str, input().split())


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


def input(): return sys.stdin.readline().rstrip()


def debug(table, *args):
    ret = []
    for name, val in table.items():
        if val in args:
            ret.append('{}: {}'.format(name, val))
    print(' | '.join(ret), file=sys.stderr)


yn = {False: 'No', True: 'Yes'}
YN = {False: 'NO', True: 'YES'}
MOD = 10**9+7
inf = float('inf')
IINF = 10**19
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']

show_flg = False
# show_flg = True


def main():
    X = I()
    ans = 100

    for i in range(1, 10**19):
        ans = int(ans * 1.01)
        if ans >= X:
            print(i)
            return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    from sys import stdin
    # from collections import defaultdict
    import math
    input = stdin.readline

    x = int(input())

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

Submission status: Accepted

Solution code:
x = int(input())

m = 100
res = 0

while(True):
    m *= 1.01
    m = int(m)
    res += 1

    if(m >= x): break

print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

money = 100

year = 0
while money < x:
    year += 1
    money += money//100

print(year)

Submission status: Accepted

Solution code:
X = int(input())
Y = 100
for ans in range(1,4000):
    Y = (Y*101)//100
    if Y >= X:
        break
print(ans)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

ans = 0
A = 100
while A < X:
    A += A//100
    ans += 1

print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8


def main():
    X = int(input())
    
    x = 100
    ans = 0
    while x < X:
        x = int(x * 1.01)
        ans += 1
    
    return ans


print(main())

Submission status: Accepted

Solution code:
x = int(input())

z = 100
i = 0
while True:
    z  = z * 1.01
    z = int(z)
    i += 1
    if z >= x:
        print(i)
        exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())
N = 100
ans = 0
while True:
    ans += 1
    N += int(N * 0.01)
    if N >= X:
        print(ans)
        exit()

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
from collections import deque, Counter, defaultdict
from itertools import chain, combinations
import json
# import numpy as np
import bisect
import sys
import math
import bisect
from functools import lru_cache

sys.setrecursionlimit(10 ** 8)

M = 10 ** 9 + 7
INF = 10 ** 17


def main():
    N = int(input())
    # A = [int(a) for a in input().split()]
    c = 1
    d = 100
    while True:
        d = int(d * 1.01)
        if d >= N:
            print(c)
            return
        c += 1


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


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

    cnt = 0
    v = 100
    while v < x:
        v = int(v + v * 0.01)
        cnt += 1

    print(cnt)


if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
x = int(input())
a = 100
for i in range(1, 10**7):
    a = math.floor(a * 1.01)
    if a >= x:
        print(i)
        exit()

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
n = 100
ans = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
now = 100
count = 0
while now<x:
    now = now*(1.01)//1
    count += 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    X = I()
    c = 100
    cnt = 0
    while c < X:
        c *= 1.01
        c = int(c)
        cnt += 1
    print(cnt)

main()

Submission status: Accepted

Solution code:
import sys


X = int(input())

year = 1
ans  = 100
while 1:

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

print(year)

Submission status: Accepted

Solution code:
x = int(input())
money = 100
for i in range(3800):
    money = int(money)
    if  money >= x:
        print(i)
        exit()
    money *= 1.01

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
n=float(input())
m=100
y=0
while m<n:
  m=int(m*1.01) 
  y+=1
print(y)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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


def main():
    X = int(input())
    ans = 0
    a = 100
    while True:
        ans += 1
        a = int(a*1.01)
        if a>=X:
            print(ans)
            break
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
X = int(input())
Y = 100
cnt = 0

while Y < X :
    Y = int(Y+Y*0.01)
    cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd # 最大公約数
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) # 最小公倍数
# list(map(int, input().split()))

x = int(input())
now = 100
ans = 0
while True:
    if now >= x:
        print(ans)
        break
    ans += 1
    now = floor(now * 1.01)

Submission status: Accepted

Solution code:
n = int(input())

m = 100

d = 0
while m < n:
    m *= 1.01
    m = int(m)
    d += 1
    
    
    
print(d)

Submission status: Accepted

Solution code:
X = int(input())
res = 0
t = 100
while X > t:
    t = (t * 1.01) // 1
    res += 1
print(res)

Submission status: Accepted

Solution code:
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))
## dp ##
def DD2(d1,d2,init=0): return [[init]*d2 for _ in range(d1)]
def DD3(d1,d2,d3,init=0): return [DD2(d2,d3,init) for _ in range(d1)]
## math ##
def to_bin(x: int) -> str: return format(x, 'b') # rev => int(res, 2)
def to_oct(x: int) -> str: return format(x, 'o') # rev => int(res, 8)
def to_hex(x: int) -> str: return format(x, 'x') # rev => int(res, 16)
MOD=10**9+7
def divc(x,y) -> int: return -(-x//y)
def divf(x,y) -> int: return x//y
def gcd(x,y):
    while y: x,y = y,x%y
    return x
def lcm(x,y): return x*y//gcd(x,y)
def enumerate_divs(n):
    """Return a tuple list of divisor of n"""
    return [(i,n//i) for i in range(1,int(n**0.5)+1) if n%i==0]
def get_primes(MAX_NUM=10**3):
    """Return a list of prime numbers n or less"""
    is_prime = [True]*(MAX_NUM+1)
    is_prime[0] = is_prime[1] = False
    for i in range(2, int(MAX_NUM**0.5)+1):
        if not is_prime[i]: continue
        for j in range(i*2, MAX_NUM+1, i):
            is_prime[j] = False
    return [i for i in range(MAX_NUM+1) if is_prime[i]]
## libs ##
from itertools import accumulate as acc
from collections import deque, Counter
from heapq import heapify, heappop, heappush
from bisect import bisect_left
#======================================================#

def main():
    x = II()
    n = 100
    y = 0
    while n < x:
        n = int(n * 1.01)
        y += 1
    print(y)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

i = 100
result = 0
while i < X:
    result += 1
    i = i * 1.01 // 1
    
print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())
yokin = 100
ans = 1
for i in range(100000):
    yokin = int(yokin * 1.01)
    if yokin >= X:
        print(ans)
        break
    ans += 1

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
input = sys.stdin.readline

base = 100
x = int(input())
year = 0

while base < x:
    base += base // 100
    year += 1
print(year)

Submission status: Accepted

Solution code:
def main():

    X = int(input())
    if X <= 100: return 0
    v = 100
    ans = 0
    while v < X:
        ans += 1
        v *= 1.01
        v = int(v)
        # print(v)s
    return ans

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
x = int(input())
# a, b = map(int, input().split())
# # k = list(map(int, input().split()))
money = 100
cnt = 0

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections
from collections import defaultdict
import math
import numpy as np
import re

x = int(input())

ans = 0
a = 100
while(True):
    a = math.floor(a*1.01)
    ans += 1
    if a >= x:
        print(ans)
        exit()

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
from math import floor


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
from collections import *

X = int(input())
now = 100
ans = 0

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

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

print(count)