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:
k =int(input())

n = 1
x = 100

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

while use < x:
    use =(use*101)//100
    count = count +1

print(count)

Submission status: Accepted

Solution code:
#n=int(input())
#n,m=list(map(int,input().split()))
#a=list(map(int,input().split()))
import math
import itertools
from collections import defaultdict
from collections import Counter
import numpy as np

import heapq
x=int(input())
ans=0
v=100
while v<x:
    v=math.floor(v*1.01)
    ans+=1

print(ans)

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

import math
X= int(input())



money = 100
cnt = 0

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

Submission status: Accepted

Solution code:
X = int(input())

ans = 0
a = 100

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

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

print(i)

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
import sys
X = int(input())
Y = 100
count = 0
for i in range(0, 10**18):
  Y = int(Y + 0.01*Y)
  count = count + 1
  if Y >= X:
    print(count)
    sys.exit()

Submission status: Accepted

Solution code:
A = int(input())
p = 100
year = 1
t = 0
while p<A:
    t += 1
    p = int(p*((1+0.01)**year))
print(t)

Submission status: Accepted

Solution code:
import math

X = int(input())

price = 100
year = 1
while 1:
  price = math.floor(price * 1.01)
  if price >= X:
    break
  else:
    year += 1

print(year)

Submission status: Accepted

Solution code:
import math

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

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

print(year)

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
x = int(input())
amount = 100
r = 0.01
year = 0

while amount < x:
    interest = int(amount * r)
    amount += interest
    year += 1

print(year)

Submission status: Accepted

Solution code:
import math
X = int(input())
a = 100
b = 1
for i in range(10000):
  a = math.floor(a*1.01)
  if a >= X:
    print(b)
    break
  else:
    b += 1

Submission status: Accepted

Solution code:
# ANSHUL GAUTAM
# IIIT-D

from math import *
from copy import *					# ll = deepcopy(l)
from heapq import *					# heappush(hp,x)
from string import *				# alpha = ascii_lowercase
from random import *				# l.sort(key=lambda l1:l1[0]-l1[1]) => ex: sort on the basis difference
from bisect import *				# bisect_left(arr,x,start,end)  => start and end parameters are temporary
from sys import stdin				# bisect_left return leftmost position where x should be inserted to keep sorted
from sys import maxsize				# minn = -maxsize
from operator import *				# d = sorted(d.items(), key=itemgetter(1))
from itertools import *				# pre = [0] + list(accumulate(l))
from collections import Counter		# d = dict(Counter(l))
from collections import defaultdict # d = defaultdict(list)

'''

'''

def solve(l):
	n = len(l)
	

a = int(stdin.readline())
f = 1
tmpp = [0]
p = 100
for i in range(1,3761):
	aa = int(p*(1.01))
	if(aa >= a):
		print(i)
		break
	else:
		p = aa

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

print(i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

x = float(input())

# print((math.log(x / 100, 1.01)))

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

print(i)

Submission status: Accepted

Solution code:
X = int(input())

t = 0
x = 100
while x < X:
  t += 1
  x = int(x * 1.01)
  
print(t)

Submission status: Accepted

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

while X > money:
  ans += 1
  money += int((money)*0.01)
  
print(ans)

Submission status: Accepted

Solution code:
import sys
x=int(input())
n=100
for i in range(3800):
    n*=1.01
    n=int(n)
    if n>=x:
        print(i+1)
        sys.exit()

Submission status: Accepted

Solution code:

import numpy as np
import math

n = int(input())

total = 100
i = 0

while True:
    total += math.floor(0.01*total)
    i += 1
    if total >= n:
        print(i)
        break

Submission status: Accepted

Solution code:
import sys

n = 100
d = 0
x = int(sys.stdin.readline())

while (n < x):
	n = (n * 101) // 100
	d += 1

print(d)

Submission status: Accepted

Solution code:
X = int(input())
x = 100
i = 1
while X>x:
    x = int(x*1.01)
    i += 1
print(i-1)

Submission status: Accepted

Solution code:
x = int(input())
money = 100
cnt = 0
for _ in range(10000):
    cnt += 1
    money *= 1.01
    money = int(money)
    if money >= x:
        print(cnt)
        exit()

Submission status: Accepted

Solution code:
from math import floor,ceil,sqrt,factorial,log
from collections import Counter, deque
from functools import reduce
import numpy as np
def S(): return input()
def I(): return int(input())
def MS(): return map(str,input().split())
def MI(): return map(int,input().split())
def FLI(): return [int(i) for i in input().split()]
def LS(): return list(MS())
def LI(): return list(MI())
def LLS(): return [list(map(str, l.split() )) for l in input()]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def LLSN(n: int): return [LS() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]

X = I()

a = 10**20
q = 0.01
cnt = 0
k = 100
for i in range(1, a):
    k += k * q
    k = floor(k)
    if k >= X:
        print(i)
        exit()

Submission status: Accepted

Solution code:
import math
x=int(input())
# lhs=x/100
# pow2=1.01
# ans=math.log(lhs,pow2)
# print(math.ceil(ans))
amt=100
# x/100= (pow((1 + rate / 100), time)) 
for i in range(1,4000):
    amt=amt*1.01
    amt=math.floor(amt)
    if amt>=x:
        print(i)
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())
t = 100
c = 0

while t < X:
    c = c + 1
    t = int(t * 1.01)

print(c)

Submission status: Accepted

Solution code:
X =int(input())
cnt = 0
kane = 100
while(X > kane):
    kane = kane * 1.01
    kane = int(kane)
    cnt += 1
    #print(kane)
print(cnt)

Submission status: Accepted

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

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:
import math
x = float(input())
res = math.log(x / 100) / math.log(1.01)
p = 100
res = 0
while p < x:
	p *= (1.01)
	p = int(p)
	res += 1
print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
X=int(input())
#print(math.log(X/100)//math.log(1.01))
count=0
XX=100
while(X>XX):
    XX=math.floor(XX*1.01)
    count+=1
print(count)

Submission status: Accepted

Solution code:
input_n = input()
n = int(input_n)

count_year = 0
money = 100

while True:
    count_year += 1
    money = int(money * 1.01)

    if money >= n:
        print(count_year)
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import floor
x = int(input())
current = 100
for t in range(10**18):
  if current >= x: break
  current = floor(1.01*current)
print(t)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

X = int(input())

bit = True
base = 100
n = 0

while bit:
  if base >= X:
    print(n)
    bit = False
  n += 1
  base += math.floor(base * 0.01)
  # print(base)

Submission status: Accepted

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

Submission status: Accepted

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

print(y)

Submission status: Accepted

Solution code:

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

    a = 100
    while a < x:
        a = int(a * 1.01)
        yield 1

print(sum(main()))

Submission status: Accepted

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

Submission status: Accepted

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

r=0.01

count=0
while True:
    count +=1
    money = int(money*(1+r))
    if x<=money:
        print(count)
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!python3

import math


# input
X = int(input())


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import math

x = int(input())
r = 0.01
i = 0
s = 100

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

Submission status: Accepted

Solution code:
import math

X = int(input())

money = 100
rate_count = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())

yokin=100
for i in range(10**6):
    yokin=yokin*101//100
    if(yokin>=x):
        print(i+1)
        break

Submission status: Accepted

Solution code:
import math
X=int(input())
y=1
z=100
for _ in range(X):
    if math.floor(z*1.01) >= X:
        print(y)
        break
    else:
        z=math.floor(z*1.01)
        y +=1

Submission status: Accepted

Solution code:
x = int(input())
def ans():
    deposit = 100
    year = 0
    while True:
        deposit  = int(deposit*1.01)
        year +=1
        if deposit < x:
             continue
        else:
            print(year)
            return

ans()

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

Solution code:
import math
k=int(input())
N=100
c=0
while N<=k:
  N+=math.floor(N*0.01)
 
  c+=1
  if N>=k:
    break
print(c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#B
import math

x = int(input())
num = int(100*1.01)
n = 1
while True:
    if x <= int(num):
        break
    else:
        n += 1
        num = int(num*1.01)
        
print(n)

Submission status: Accepted

Solution code:
import math

def main():
    b = 100
    r = 0.01
    n = 0
    target = int(input())
    while b < target:
        n += 1
        b = math.floor(b*((1+r)))
    print(n)   
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
# 初期入力
import sys
#input = sys.stdin.readline

X = int(input())
start =100
riritu =1
risi =0
i=0
syojikin =start
while X >= syojikin:
    i +=1
    risi =int(syojikin *riritu/100)
    syojikin +=risi
    if X <=syojikin:
        #print(i)
        break

print(i)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# import numpy as np
# import queue
# import heapq


def main():
    print(resolve())


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

    c = 100
    for year in range(1, 10**9):
        c = c * 101 // 100
        if c >= X:
            return year


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(count)

Submission status: Accepted

Solution code:
X = int(input())

i = 0
M = 100
while True:
  i += 1
  N = (M*1.01)//1
  if N >= X:
    ans = i
    break
  M = N

  
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/python3

import math
#標準出力からの読み込み
input_a = input()
x = int(input_a)

#判定ロジック
a = 100
i = 0
while True:
    i = i + 1
    a = math.floor(a*1.01)
    if a >= x:
        print(i)
        break;

Submission status: Accepted

Solution code:
X = int(input())

S = 100

Y = 0

while  S < X :
    S = int(S * 1.01) 
    Y += 1

print(Y)

Submission status: Accepted

Solution code:
X = int(input())

save = 100
ans = 0

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())
startyear = 100
nowyear = startyear
nextyear = nowyear
year = 0
while nowyear < X:
  year = year + 1
  nextyear = int(nowyear * 1.01)
  nowyear = nextyear
print(year)

Submission status: Accepted

Solution code:
X = int(input())

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

print(ans)

Submission status: Accepted

Solution code:
X=int(input())
n=0
m=100

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

Submission status: Accepted

Solution code:
import math

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

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

print(count)

Submission status: Accepted

Solution code:
import math
x = int(input())
p = 100
count = 0
while x > p:
  count = count+1
  p = math.floor(p*1.01)
print(count)

Submission status: Accepted

Solution code:
import math

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

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

print(year)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math

x = int(input())
mt = 100
ans = 0
while x > mt:
    m = mt * 1.01
    mt = math.floor(m)
    ans += 1

print(ans)

Submission status: Accepted

Solution code:
x = int(input())
y = 100
risi = 0
result = 0
while y  <= x:
  y *= 1.01 
  y = y // 1
  result += 1
  if y >= x:
    break
print(int(result))

Submission status: Accepted

Solution code:
A=int(input())
count=0
money=100

while money<A:
    money=int(money*1.01)
    count=count+1

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

cnt = 0
deposit = 100
while True:
    if deposit >= x:
        break
    deposit = deposit * 101 // 100
    cnt += 1

print(cnt)

Submission status: Accepted

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

while True:
  Y = Y + 1
  D = int(D * 1.01)
  if X <= D:
    print(Y)
    break

Submission status: Accepted

Solution code:
def solve(x):
    cur = 100
    for i in xrange(10000):
        if cur >= x:
            return i
        cur = int(cur * 1.01)
    return -1

assert solve(103) == 3
assert solve(101) == 1
assert solve(10 ** 18) != -1
assert solve(1000000000000000000) == 3760


x = int(raw_input())
print solve(x)

Submission status: Accepted

Solution code:
x = int(input())

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

print(i)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

Solution code:
import math

x=int(input())
yokin,years=100,0

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

Submission status: Accepted

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

print(i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Xの入力
X = int(input())

# 最初の預け金Yの初期値(100円)
Y = 100

# X円になるi年後の初期値
i = 0

while(X > Y):
    Y = int(Y * 1.01)
    i += 1

print(i)

Submission status: Accepted

Solution code:
x = int(input())
import sys
sys.setrecursionlimit(4000)

import math
p = math.log(1.01, 10)
q = int(math.log(x/100, 10)/p)


def f(n):
  if n == 1:
    return 101
  else:
    return int(f(n-1)*1.01)
n = q
while f(n) < x:
  n += 1
else:
  print(n)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
X = int(input())
money = 100
Years = 0
while True :
    Years += 1
    money += int(money * 0.01)
    if money >= X:
        print(Years)
        break

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
def main():
    X = int(input())
    S = 100

    for i in range(1, 20001):
        S = int(S*1.01)

        if S >= X:
            print(i)
            break

if __name__ == "__main__":
    main()

Submission status: Accepted

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


def solve(X: int):
    current = 100
    count = 0
    while current < X:
        current = int(current*1.01)
        count += 1
    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())
c = 0
m = 100
while True:
    m = int(m*1.01)
    c = c + 1
    if m >= x:
        print(c)
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
X=int(input())
def an(n,r=1.01):
  a=100
  for i in range(1,n+1):
     a=math.floor(a*r)
  return a

for n in range(1,10**8):
  if X<=an(n):
    print(n)
    break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())
money = 100
Years = 0
while True :
    Years += 1
    money += int(money * 0.01)
    if money >= X:
        print(Years)
        break

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def LS(): return [list(x) for x in sys.stdin.readline().split()]


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


def LIR(n):
    return [LI() for i in range(n)]


def SR(n):
    return [S() for i in range(n)]


def LSR(n):
    return [LS() for i in range(n)]


sys.setrecursionlimit(1000000)
mod = 1000000007


def solve():
    x = I()
    bank = 100
    count = 0
    while bank < x:
        bank *= 101
        bank //= 100
        count += 1
    print(count)
    return


# Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
import math

tmp = input().split()
X = int(tmp[0])
Xn_1 = 100
Year = 0

while True:
    Xn = Xn_1*1.01
    Year = Year + 1
    if Xn >= X:
        print(Year)
        break
    Xn_1 = math.floor(Xn)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import itertools

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

X = int(read())

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

Submission status: Accepted

Solution code:
import math

x=int(input())

m=100
i=0.01
ans=1

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

Submission status: Accepted

Solution code:
import math

#数値ひとつ
I = int(input())
#数値空白区切りで欲しいとき
#N, M = map(int, input().split())
#文字欲しいとき
#N = input()
#それをListにしたいとき
#list = list(N)
#数値を受け取る数が未定かつリストにしたいとき
#list = list(map(int, input().split()))
#受け取る文字列が未定かつリストにしたいとき(Iは回数)
#list = [input() for i in range(I)]

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




if I <= 100:
    cnt = 0

print(cnt)

Submission status: Accepted

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

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:
T = int(input())
a = 0
n = 100
while n < T:
    n = n * 1.01
    n = int(n)
    a = a + 1
print(a)

Submission status: Accepted

Solution code:
a = int(input());
aa = 1.0;
bb = 1.01;
num = 100;

for i in range(0, 100000000000, 1):
    if (num >= a):
        print(i);
        break;
    num = num * (1.01);
    num = int(num);

Submission status: Accepted

Solution code:
#-*- using:utf-8 -*-

x = int(input())
a = 100
cnt=0
while a<x:
    cnt+=1
    a = int(a)*1.01
    #print ("cnt:" + str(cnt))
    #print("a=" + str(a))
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
e = 100
ans = 1

while True:
    e += e // 100
    if e >= x:
        print(ans)
        break
    else:
        ans += 1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

def year(x):
  return(x + x * 100 // 10000)


money = 100
 
  
h = 0

while x > money:
  money = year(money)
  h = h + 1
  
print(h)

Submission status: Accepted

Solution code:
import math
X=int(input())
temp = math.floor(100*0.01)
#print(temp+100)
for i in range(2,1000000000):
  temp += math.floor((100+temp) * 0.01)
  #print(temp+100)
  if temp+100 >= X:
    print(i)
    exit()

Submission status: Accepted

Solution code:
X = int(input())
N = 100
for i in range(1,10000000000):
  N = int(N*1.01)
  if N >= X:
    print(i)
    break

Submission status: Accepted

Solution code:
X = int(input())

year = 1
n = 100
while True:
    if n >= X:
        print(year-1)
        exit()
    n = int(n * 1.01)
    year += 1

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())



syozikin = 100
ans = 0

while syozikin < X:
    syozikin = syozikin*1.01
    syozikin =syozikin  // 1
    ans = ans + 1
print(ans)

Submission status: Accepted

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

year = 0
while True:
    year += 1
    M = int(M * 1.01)

    if M >= X:
        break

print(year)

Submission status: Accepted

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

a = 100

cnt = 0

while floor(a) < x:
    a = floor(a) * 1.01
    cnt += 1

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(x):
    ans = x - count
    if ans <= 0:
        print(y)
        exit()
    else:
        ten = count * 0.01
        count += math.floor(ten)
        y += 1

Submission status: Accepted

Solution code:
import math
X=int(input())
n=1
y=100

while True:
    if math.floor(y*1.01)>=X:
        break 
    y=math.floor(y*1.01)
    n+=1

print(n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())
cache = 100
y = 0

for f in range(1000000000000000000000):
    cache += cache // 100
    y += 1
    if X <= cache:
        break

print(y)

Submission status: Accepted

Solution code:
import math
n=int(input())
yen=float(100)
count=0

while yen<n :
  yen=yen*1.01
  count+=1
  yen=math.floor(yen)
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
X=int(input())
start=math.ceil(math.log(X/100,1.01))
kouza=100
for i in range(0,1000000):
  kouza=math.floor(kouza*1.01)
  #if i % 100 == 0:
    #print(kouza)
  if kouza >= X:
    print(i+1)
    break

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 math
k= int(input())

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