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:
def main():
    X = int(input())
    n = 100
    cnt = 1
    while True:
        n =int(n*1.01)
        if n >= X:
            print(cnt)
            return
        cnt += 1
        
if __name__=='__main__':
    main()

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:
import math

x=int(input())

money = 100
year = 0

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

print(year)

Submission status: Accepted

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

while money < x:
	money += int(money*0.01)
	y += 1
print(y)

Submission status: Accepted

Solution code:
import random
import math
LI = lambda: list(map(int,input().split()))
MI = lambda: map(int,input().split())
yes = lambda: print("Yes")
no = lambda: print("No")
I = lambda: list(input())
J = lambda x: "".join(x)
II = lambda: int(input())
SI = lambda: input()
#---khan17---template
t = II()
temp = 100
i = 0
while True:
	i+=1
	temp*=1.01
	temp = int(temp)
	if temp>=t:
		print(i)
		break

Submission status: Accepted

Solution code:
import sys
import math  # noqa
import bisect  # noqa
import queue  # noqa


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


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

    n = 0
    a = 100
    while a < X:
        a = int(a * 1.01)
        n += 1

    print(n)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from math import sqrt,ceil

# map(int,input().split())

n=int(input())

s=100
c=0
while(s<n):
    p=s//100
    s=s+p
    c+=1
    # print(s)
print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
N = int(input())
y = 100
count = 0
for i in range(10**18):
    if y >= N:
        print(count)
        break
    y = math.floor(y*1.01)
    count += 1

Submission status: Accepted

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

Submission status: Accepted

Solution code:

import sys
# sys.setrecursionlimit(10**6)
input = sys.stdin.buffer.readline
# arr = [[int(el) for el in input().split()] for i in range(n)]

def cal(x):

    bl = 100
    c = 0

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

    return c


x = int(input())

print (cal(x))

Submission status: Accepted

Solution code:
import numpy as np
import math
import scipy as sp
import queue
import collections

MOD = 10 ** 9 + 7
INF = 10 ** 9

def main(kwargs):
    x = kwargs["x"]
    n = 100
    res = 0

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

    return res

if __name__ == "__main__":
    kwargs = {}

    cin = input().split()
    #kwargs["n"] = cin[0]
    #kwargs["n"], kwargs["k"] = cin
    kwargs["x"] = [int(i) for i in cin][0]
    #kwargs["n"], kwargs["k"] = [int(i) for i in cin]

    cout = main(kwargs)
    print(cout)

Submission status: Accepted

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

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

print(y)

Submission status: Accepted

Solution code:
from collections import defaultdict,deque
import sys, heapq, bisect, math, itertools, string, queue, copy, time
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp():
    '''
    一つの整数
    '''
    return int(input())
def inpl():
    '''
    一行に複数の整数
    '''
    return list(map(int, input().split()))


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

x = int(input())

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

Submission status: Accepted

Solution code:
x=int(input())

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
x = int(input())

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

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:
#!/usr/bin/env python3

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

x = I()
ans = 0
a = 100
while 1:
    ans += 1
    a = int(1.01*a)
    if a >= x:
        print(ans)
        quit()

Submission status: Accepted

Solution code:
f = 100

x = int(input())
cnt = 0
while True:
    f = int(f * 1.01)
    cnt += 1
    if(f >= x):
        break

print(cnt)

Submission status: Accepted

Solution code:
# coding: utf-8
import sys

stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces


def main():
    x = ni()
    now = 100
    cnt = 0
    while 1:
        if now >= x:
            print(cnt)
            return
        now = int(now*1.01)
        cnt += 1
    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
X = int(input())
answer = 0
m = 100
while True:
    answer += 1
    m = m + m // 100
    if m >= X:
        print(answer)
        exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
#sys.setrecursionlimit(150000)


def solve(X: int):
    A=100
    ans=1
    while True:
        A=int(A*1.01)
        if X<=A:
            print(ans)
            exit()
        else:
            ans+=1
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools
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:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))

x = ii()
mon = 100
for i in range(1,10000):
    mon *= 1.01
    mon = int(mon)
    if mon >= x:
        ans = i
        break
print(ans)

Submission status: Accepted

Solution code:
X = int(input())

yokin = 100
counter = 0
while True:
    if yokin < X:
        yokin = int(yokin * 1.01)
        counter += 1
    if yokin >= X:
        print(counter)
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

r = 100
cnt = 0
while r<X:
    r = int(r*1.01)
    cnt += 1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=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)]
dep=100
import math
ans=0
while True:
    ans+=1
    dep=math.floor(dep*1.01)
    if dep>=x:
        break
print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

X = ir()
answer = 0
num = 100
while num < X:
    answer += 1
    num *= 1.01
    num = int(num)

print(answer)

Submission status: Accepted

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

years = 0

while money < x:
    money += int(money*0.01)
    years += 1

print(years)

Submission status: Accepted

Solution code:
import math
X = int(input())
y = float(100)
t = 0
while y < X:
  t += 1
  y = math.floor(y*1.01)
print(str(t))

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

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

print(count)

Submission status: Accepted

Solution code:
X=int(input())


a=100

count=0
while(1):
    count=count+1
    a=int(a*0.01+a)

    if(a>=X):
        print(count)
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

if __name__ == "__main__":
  x = int(input())
  money = 100
  count = 0
  while True:
    if x <= money:
      print(int(count))
      exit()
    money = math.floor(money*1.01)
    count += 1

Submission status: Accepted

Solution code:
## coding: UTF-8

X = int(input())

#l = [100]

now = 100
ans = 0
for i in range(3761):
    now = int(now * 1.01)
    #print(now)
    if(now >= X):
        ans = i+1
        break
    #l.append(now)

print(ans)
#print(l)

#ans = 0
#for i in range(3761):



'''
counter = 0
while now<10**18:
    counter += 1
    now = int(now*1.01)
print(counter)
'''

Submission status: Accepted

Solution code:
# from math import log10
X = int(input())
d = 100
n = 0
while d < X:
    n += 1
    d = int(d * 1.01)

print(n)

Submission status: Accepted

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

import math

def main():
    x = int(input())
    m = 100
    i = 0
    while m < x:
        i += 1
        m = math.floor(m*1.01)

    print(i)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())
n = 100
year = 0
while n < X:
    n += int(n * 0.01)
    year += 1

print(year)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
deposit = 100
year = 0

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

print(year)

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


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

    cnt = 0
    curr = 100
    while curr < x:
        cnt += 1
        curr = int((curr * 1.01) // 1)

    print(cnt)


submit()

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict, Counter, deque
from itertools import accumulate, permutations, combinations
from operator import itemgetter
from bisect import bisect_left, bisect_right, bisect
from heapq import heappop, heappush
from fractions import gcd
from math import ceil, floor, sqrt, cos, sin, pi
from copy import deepcopy

# If you use recursive call, uncomment this code
#sys.setrecursionlimit(10**6)

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

while a<x:
  a=101*a//100
  d+=1

print(d)

Submission status: Accepted

Solution code:
x = int(input())

count,money = 0,100
while money < x:
    money = int(1.01*money)
    count += 1

print(count)

Submission status: Accepted

Solution code:
n=int(input())

start = 100

count =0

while start < n:
    start = int(1.01*start)
    count += 1
print(count)

Submission status: Accepted

Solution code:
a = 100
n = int(input())
c = 0
while(True):
    a += int((a * .01))
    if(a >= n):
        break
    c += 1   
print(c + 1)

Submission status: Accepted

Solution code:
m = 100
goal = int(input())
year = 0

while goal > m:
  m *= 1.01
  m = int(m)
  year += 1
print(year)

Submission status: Accepted

Solution code:
x = int(input())

n = 0
m = 100
while m < x:
    m = (m * 101) // 100
    n += 1
print(n)

Submission status: Accepted

Solution code:
x=int(input())

now=100
for n in range(1,10**5):
    now=int(now*1.01)
    if now>=x:
        break
print(n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

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

print(cnt)

Submission status: Accepted

Solution code:
x = int(input())

cnt = 0
yen = 100
while 1:
    cnt += 1
    yen *= 1.01
    yen = int(yen)
    if yen >= x: break

print(cnt)

Submission status: Accepted

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

print(y)

Submission status: Accepted

Solution code:
import math

X = int(input())

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

print(count)

Submission status: Accepted

Solution code:
X=int(input())
#100
now=100
count=0
while now<X:
    now=now+int(now*0.01)
    count+=1

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
ans = 100
count = 0
for i in range(4000):
    ans = int(ans*1.01)
    count += 1
    if ans >= x:
        print(count)
        exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def mapint_inp():
    return map(int, input().split())

def intinp():
    return int(input())

X = intinp()
Y = 100

ans = 0
while Y < X:
    if Y >= X:
        break
    Y += Y//100
    ans += 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

y = 100
i = 0
while X > y:
    i += 1
    y += (y//100)
    if y >= X:
        print(i)
        break

Submission status: Accepted

Solution code:
import sys
X=int(input())
year=1
m=100
while True:
  m+=int(m*0.01)
  if m>=X:
    print(year)
    sys.exit()
  year+=1

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

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

print(res)

Submission status: Accepted

Solution code:
#create date: 2020-05-02 21:13

import sys
stdin = sys.stdin

def ns(): return stdin.readline().rstrip()
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))

def main():
    x = ni()
    now = 100
    cnt = 0
    while x > now:
        now *= 1.01
        now = int(now)
        #print(now)
        cnt += 1
    print(cnt)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

    start_num = 100
    max_num = 3760+1000
    for i in range(max_num):
        if start_num >= x:
            print(i)
            exit()
        start_num = start_num + math.floor(start_num * 0.01)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x = int(input())
temp=10**9
a=100
for i in range(1,100000):
    a+=a*0.01
    a=int(a)
    if a>=x:
        print(i)
        exit()

Submission status: Accepted

Solution code:
X=int(input())

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

Submission status: Accepted

Solution code:
import math

# print('input >>')
X = int(input())
money = 100
i = 0
while True:
    i += 1
    money = math.floor(1.01*money)
    if money >= X:
        print(i)
        break

# print('-----output-----')

Submission status: Accepted

Solution code:
import math
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    x=INT()
    year=0
    temp=100
    while temp<x:
        temp=int(temp*1.01)
        year+=1
    print(year)
if __name__ == '__main__':
    do()

Submission status: Accepted

Solution code:
X = int(input())
yen = 100
year = 10**18

for i in range(year):
    yen *= 1.01
    yen = int(yen)
    #print(yen)
    if X <= yen:
        break

print(i+1)

Submission status: Accepted

Solution code:
x=int(input()) ; i=1 ; A=[100 for i in range(10**5)]
for i in range(1,10**5):
    A[i]=int(A[i-1]*1.01)
    if A[i]>=x:
        print(i)
        exit()

Submission status: Accepted

Solution code:
import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from collections import deque
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def S(): return sys.stdin.readline().rstrip()
def LS(): return sys.stdin.readline().split()
def LS2(N): return [sys.stdin.readline().split() for i in range(N)]
def FILL(i,h): return [i for j in range(h)]
def FILL2(i,h,w): return [FILL(i,w) for j in range(h)]
def FILL3(i,h,w,d): return [FILL2(i,w,d) for j in range(h)]
def FILL4(i,h,w,d,d2): return [FILL3(i,w,d,d2) for j in range(h)]
def sisha(num,digit): return Decimal(str(num)).quantize(Decimal(digit),rounding=ROUND_HALF_UP)
#'0.01'や'1E1'などで指定、整数に戻すならintをかます
MOD = 1000000007
INF = float("inf")
sys.setrecursionlimit(10**5+10)
input = sys.stdin.readline

X = I()
num = 100
i=0
while True:
    i+=1
    num = int(num*1.01)
    if X<=num:
        break
print(i)

Submission status: Accepted

Solution code:
import math

N = int(input())

cnt = 0
m = 100

while m < N:
  m = math.floor(m * 1.01)
  cnt += 1
  
print(int(cnt))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

solve()

Submission status: Accepted

Solution code:
X = int(input())

year = 0
money = 100


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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
def main():
    x = int(input())
    yo = 100
    cnt = 0
    while True:
        yo = int(yo * 1.01)
        cnt += 1
        if yo >= x:
            print(cnt)
            return 0
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

year = 0
now = 100
while True:
    now = math.floor(now * 0.01) + now
    year += 1
    if now >= x:
        print(year)
        exit()

Submission status: Accepted

Solution code:
X = int(input())

init = 100

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

check = True
a = 100
ans = 0
while check:
  a += a // 100
  ans +=1
  if a >= x:
    check = False
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X=int(input())
m = 100
for i in range(5000):
  if m >= X:
    print(i)
    break
  m += (m // 100)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(year)

Submission status: Accepted

Solution code:
x = int(input())
m = 100
y = 1
while(True):
    m = m * 101 // 100
    if m >= x:
        print(y)
        break
    y += 1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import collections

def main():
    X = int(input())
    count = 0
    m = 100

    while True:
        if m >= X:
            print(count)
            break
        m = int(m * 1.01)

        count += 1

    return 0

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
X = int(input())

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

print(i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import math
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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

X = INT()

i = 0
a = 100

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

Submission status: Accepted

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

year = 0
under = 1
while under:
    yen = yen * 101 // 100
    year += 1
    if yen >=X:
        break
print(year)

Submission status: Accepted

Solution code:
import math

X = int(input())
bal = 100

i = 0
while (bal < X):
    bal = bal + math.floor(bal * 0.01)
    i += 1

print(i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

def main():
    X=int(input())
    tmp=100
    ans=0
    while(1):
        if (tmp>=X):
            print(ans)
            exit()
        else:
            tmp=math.floor(tmp*1.01)
            ans+=1
    
if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:

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

while m < X:
  y += 1
  m = int(m * 1.01)
print(y)

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
x = int(input())

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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


for i in range (1, 100000):
	money = math.floor(money*1.01)
	if  money >= X:
		print(i)
		exit()

Submission status: Accepted

Solution code:
# coding: utf-8

x = int(input())
a = 100
for i in range(100000):
    a = int(a*1.01)
    if a >= x:
        ans = i+1
        break

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

if __name__=='__main__':
    main()

Submission status: Accepted

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

print(t)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

X = int(input())
mon = 100

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from functools import lru_cache, reduce
from heapq import heapify, heappop, heappush
from itertools import chain, combinations, permutations, product
from typing import List, Dict

# import numpy as np

sys.setrecursionlimit(10**5 + 1)
input = sys.stdin.readline
write = sys.stdout.write


def read_item(cls=int):
    return cls(input())


def read_n_item(cls=int) -> list:
    return [cls(s) for s in input().split()]


def list2d(row, col, init_val=0) -> List[list]:
    return [[init_val] * col for _ in range(row)]


MOD = 10**9 + 7
# MOD = 998244353


x = read_item()
n = 0
cur = 100
while cur < x:
    n += 1
    cur += cur // 100
print(n)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from math import floor
X = int(input())
money = 100
year = 0
while True:
    year += 1
    money = floor(money * 1.01)
    if X <= money:
        print(year)
        break