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:
x = int(input())
y = 100
cnt = 0
while y < x:
    y = int(y * 1.01)
    cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
K = int(input())

ans = 100
for i in range(1, 10**6):
  ans = int(ans * 1.01)
  if ans >= K :
    print(i)
    break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

money = 100
i = 0
while money < x:
    i += 1
    money *= 1.01
    money //= 1
print(i)

Submission status: Accepted

Solution code:
import math

X = float(input())

y = 0
z = 100
while True:
  y += 1
  z = math.floor(z*1.01)
  if z >= X:
    print(y)
    break

Submission status: Accepted

Solution code:
x = int(input())

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

print(ans)

Submission status: Accepted

Solution code:
# B

import math
inp = input()

X = int(inp)
r = 1e-2

n = 0
price = 100
while price < X:
    price = math.floor(price*(1.0+r))
    n = n + 1
print(n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X=int(input())

x=100
for i in range(5000):
    x*=101
    x//=100
    if(x>=X):
        print(i+1)
        break

Submission status: Accepted

Solution code:
from __future__ import print_function

import sys
sys.setrecursionlimit(500000)

import re
import array
import copy
import functools
import operator

import math
import string
import fractions
from fractions import Fraction

import collections
import itertools
import bisect

import random
import time

import heapq
from heapq import heappush
from heapq import heappop
from heapq import heappushpop
from heapq import heapify
from heapq import heapreplace
from queue import PriorityQueue as pq
from queue import Queue

from itertools import accumulate

from collections import deque
from collections import Counter

from operator import mul
from functools import reduce

input = sys.stdin.readline


def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
    return

# from fractions import gcd
# from math import gcd

# def lcm(n, m):
#     return int(n * m / gcd(n, m))


# def coprimize(p, q):
#     common = gcd(p, q)
#     return (p // common, q // common)


# def find_gcd(list_l):
#     x = reduce(gcd, list_l)
#     return x


def combinations_count(n, r):
    r = min(r, n - r)
    numer = reduce(mul, range(n, n - r, -1), 1)
    denom = reduce(mul, range(1, r + 1), 1)
    return numer // denom


def main():
    x = int(input().strip())
    temp=100
    for i in range(1000000000):
        if temp>=x:
            print(i)
            return
        temp=int(temp*1.01)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
from io import StringIO
import unittest

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

    depo = 100
    ans = 0

    while 1:
        ans += 1
        depo = int(depo * 1.01)

        if depo >= x:
            break

    print(ans)

class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """103"""
        output = """3"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """1000000000000000000"""
        output = """3760"""
        self.assertIO(input, output)
    def test_入力例_3(self):
        input = """1333333333"""
        output = """1706"""
        self.assertIO(input, output)

if __name__ == "__main__":
    #unittest.main()
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    x = int(input())
    a = 100
    count = 0
    while x > a:
        a = int(a*1.01)
        count += 1

    print(count)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

while True:
    if money >= x:
        break
    year += 1
    money += money // 100

print(year)

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

X = int(input())

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

Submission status: Accepted

Solution code:
x=int(input())
import math
value=100
year = 0
while value<x:
    value*=1.01
    value=math.floor(value)

    year+=1
print(year)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#
import sys
import math
import numpy as np
import itertools

# ひとつ入力
n = int(input())
i = 0
a = 100
while 1:
    if a >= n:
        print(i)
        exit()
    a = int(a * 1.01)
    i += 1

Submission status: Accepted

Solution code:
x=int(input())

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

print(c)

Submission status: Accepted

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

print(y)

Submission status: Accepted

Solution code:
def main():
    x = int(input())
    y = 100
    for i in range(0,10**18):
        if y >= x:
            print(i)
            break
        y += y // 100

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import math
X = int(input())
money = 100
ans_year = 0
while X > money:
    money *= 1.01
    money = math.floor(money)
    ans_year += 1
print(ans_year)

Submission status: Accepted

Solution code:
from collections import defaultdict
from math import gcd
import time
import sys
from collections import Counter
import itertools
import math
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
start = time.time()
# N = list(map(int, input()))[::-1]
N = int(input())
# A, B = map(int, input().split())
y = 0
s = 100
while 1:
    s *= 1.01
    s = math.floor(s)
    y += 1
    if s >= N:
        print(y)
        exit()

Submission status: Accepted

Solution code:
# your code goes here
m = 100
x = int(input())

ans = 0;
while(m < x):
	m *= 101
	m //= 100
	ans += 1

print(ans)

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

Solution code:
x = int(input())

tyo = 100
nen = 0

if tyo >= x:
    print(0)
else:
    while tyo < x:
        nen+=1
        tyo = int(tyo * 1.01)
        if tyo >= x:
            print(nen)
            break

Submission status: Accepted

Solution code:
x = int(input())
m = 100
for i in range(1, 10**18):
    m = int(m * 1.01)
    if m >= x:
        print(i)
        break

Submission status: Accepted

Solution code:
#B

X=int(input())
cnt=0
Y=100
while True:
    cnt+=1
    risi=int(Y*0.01)
    Y=Y+risi
    if Y>=X:
        print(cnt)
        break

Submission status: Accepted

Solution code:
X = int(input())

def f(x):
    i = 0
    while x < X:
        i += 1
        x = int(x * 1.01)
    return i

print(f(100))

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = 10**20
def I(): return int(input())
def F(): return float(input())
def S(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()

def resolve():
    X = I()
    year = 0
    yokin = 100
    while yokin<X:
        yokin = int(yokin*1.01)
        year += 1

    print(year)

if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

x = int(input())
y = 100 
cnt = 0 
while True:
    y = math.floor(y*1.01)
    cnt += 1
    if x <= y:
        print(cnt)
        exit(0)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
N =int(input())
num=100
import math
for i in range(100000):
    num = math.floor(num*1.01)
    if num >= N:
        print(i+1)
        break

Submission status: Accepted

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

Submission status: Accepted

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

# process
ans = 0
y = 0
m = 100
while m < X:
    m = m + m*1//100
    y += 1

# output
print(y)

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
def main(x):
    res = 0
    t = 100
    while t < x:
        res += 1
        t += math.floor(t * 0.01)
    return res

x = int(input())
print(main(x))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

x = int(input())
count = 0
now = 100
flag = True

while flag:
  now = math.floor(now * 1.01)
  count += 1
  if now >= x:
    flag = False

print(count)

Submission status: Accepted

Solution code:
X = int(input())

balance = 100
year = 0

while balance < X:
    balance += (balance * 0.01) // 1
    year += 1

print(year)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
K=int(input())
M=100
l=0
while M<K:
    M=math.floor(M*(1.01))
    l=l+1
print(l)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X=int(input())

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

print(i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
INF = 10**10
MOD = 10**9 + 7
X = int(input())
d = 100
for i in range(4000):
    d = int(d * 1.01)
    if d >= X:
        print (i+1)
        exit()

Submission status: Accepted

Solution code:
import itertools
import math
import numpy as np
import fractions
from collections import deque
from itertools import combinations
from functools import reduce
from functools import lru_cache
import bisect
import sys
sys.setrecursionlimit(10**9)

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

    x = 100
    for r in range(1,1000000):
        x = math.floor(x * 1.01)
        if x >= X:
            print(r)
            exit()



if __name__ == "__main__":
  main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

d = 100
y = 0


while True:
# for i in range(10):
    d = int(1.01 * d)
    y += 1
    # print(d)
    if d >= x:
        print(y)
        exit()

Submission status: Accepted

Solution code:
n=int(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())
c = 0
a = 100
while True:
    a = int(a*1.01)
    c+=1
    if a>=x:
        print(c)
        break

Submission status: Accepted

Solution code:
X = int(input())

a = 100
i = 0
while a < X:
    a += int(a * 0.01)
    i += 1
print(i)

Submission status: Accepted

Solution code:
x = int(input())

s = 100
y = 0
while x > s:
    s = int(s * 1.01)
    y += 1

print(y)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
def main():
  X=int(input())
  Xtgt=100
  i=0
  sFlag=True
  while(sFlag):
    i=i+1
    Xtgt=math.floor(Xtgt*(1+0.01))
    if(Xtgt>=X):
      print(i)
      sFlag=False
  
if __name__=='__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

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

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

print(i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

Solution code:
X = int(input())

m = 100

year = 0

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

print(year)

Submission status: Accepted

Solution code:
import math

X = int(input())

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(X):

    start = 100

    curr = start
    years = 0
    while curr < X:
        curr += int(0.01 * curr)
        years += 1

    return years

def iin(): return int(input())
X = iin()
print(solve(X))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

y = 100
i = 0

while True:
    if y >= x:
        break
    y = int(y * 1.01)
    i += 1

print(i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def read_int():
    return int(input())

def read_int_map():
    return map(int,input().split(' '))

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

def read_s_list_loop(n):
    return [input() for _ in range(n)]
import math

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

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

print(year)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import log,ceil
x=int(input())
ans=0
cur=100
while cur<x:
    cur*=1.01
    cur=int(cur)
    ans+=1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

i=0
while True:
    
    i+=1
    chokin=int(chokin*1.01)

    if chokin>=x:
        print(i)
        break

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math


def task(x):
    years = 0
    yens = 100
    while yens < x:
        yens = math.floor(yens * 1.01)
        years += 1

    print(years)


x = int(input())
task(x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline

x = int(input())

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

print(ans)

Submission status: Accepted

Solution code:
X=input()
n=100
for i in range(1,4000):
    n=int(n*1.01)
    if X<=n:
        print i
        quit()

Submission status: Accepted

Solution code:
import math
k=int(input())
cnt=0
money=100

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

Submission status: Accepted

Solution code:
from math import log,ceil
X = int(input())
i = 100
cnt = 0
while True:
    i *= 1.01
    i = int(i)
    cnt += 1
    if i >= X:
        break

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

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

print(cnt)

Submission status: Accepted

Solution code:
X = int(input())

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

print(i)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    a = int(input())
    now = 100
    count = 0
    while now <a:
        count +=1
        now = int(now *1.01)
    print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# B - 1%

x = int(input())

p = 100
y = 0
while p < x:
    p += p // 100
    y += 1

print(y)

Submission status: Accepted

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

Submission status: Accepted

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

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:
a = int(input())
b = 100
ans = 0
while b < a:
    ans += 1
    b = (b *1.01)//1

print(ans)

Submission status: Accepted

Solution code:
X = int(input())

i = 0
tmp = 100

while tmp < X:
    tmp = int(tmp * 1.01)
    i += 1
    
print(i)

Submission status: Accepted

Solution code:

def solve():

    X = int(input())

    i = 100
    j = 0
    while True:
        i *= 1.01
        j += 1
        i = int(i)

        if X <= i:
            print(j)
            exit()


if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
from sys import stdin
import math

X = float(stdin.readline().rstrip())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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


try:
    sys.stdin = open(sys.path[0] + '\\input.txt', 'r')
    sys.stdout = open(sys.path[0] + '\\output.txt', 'w')
except FileNotFoundError:
    pass


x = int(input())

n = 100
t = 0
while n < x:
    n += (0.01 * n)
    n = int(n)
    t += 1
    # print(n, t)

print(t)

Submission status: Accepted

Solution code:
x = int(input())

y = 100
ans = 0
while y < x:
  y = (y * 101) // 100
  ans += 1
print (ans)

Submission status: Accepted

Solution code:
x = int(input())
y = 100
for i in range(10**10):
    y += y//100
    if y >= x:
        print(i+1)
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import floor
x=int(input())
i=0
m=100
while x>m:
  i+=1
  m=floor(m*1.01)
print(i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat May  2 20:59:09 2020
"""

import sys
#import numpy as np

sys.setrecursionlimit(10 ** 9)
#def input():
#    return sys.stdin.readline()[:-1]
mod = 10**9+7

X = int(input())
#X, Y = map(int,input().split())
#A = list(map(int,input().split()))
#graph = [[] for _ in range(N+1)]
#for _ in range(N-1):
#    a, b = map(lambda x : int(x)-1, input().split())
#    graph[a].append(b)
#    graph[b].append(a)
m = 100
for ans in range(1,10**5):
    m += m//100
#    print(ans,m)
    if m >= X:
        break

print(ans)

Submission status: Accepted

Solution code:
# ABC165 B

def main():
    x = int(input())
    balance = 100
    year = 0

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

Solution code:
import math

X=int(input())

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

Submission status: Accepted

Solution code:
X = int(input())

p = 100
ans = 0
while p < X:
    p *= 101
    p //= 100

    ans += 1
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
X = int(input())

max_num = 10 ** 10
ans = 0
money = 100
for i in range(1, max_num):
    money *= 1.01
    money = money // 1
    if money >= X:
        ans = i
        break
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

while bank < X:
    bank = (bank*1.01)//1
    count += 1

print(count)

Submission status: Accepted

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

#n = int(input())
#l = list(map(int, input().split()))
'''
A=[]
B=[]
for i in range():
    a, b = map(int, input().split())
    A.append(a)
    B.append(b)'''

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

while x>a:
    a=int(a*1.01)
    cnt+=1
    #print(a)
print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

money = 100
year = 0

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

print(year)

Submission status: Accepted

Solution code:
x = int(input())

y = 100

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

print(cnt)

Submission status: Accepted

Solution code:
from decimal import *
x = int(input())

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

Submission status: Accepted

Solution code:
X = [int(i) for i in input().split()][0]
y = 100
for i in range(1, 100000):
  y = y + int(0.01*y)
  if y>= X:
    break
print(i)

Submission status: Accepted

Solution code:
x= int(input())

i=100
cnt = 0
while(x>i):
    i = int(i*1.01)
    cnt +=1

print(cnt)

Submission status: Accepted

Solution code:
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

x = ii()
y = 100

for i in range(1,10**18):
    y = int(y * 1.01)
    if y >= x:
        print(i)
        break

Submission status: Accepted

Solution code:
from math import floor

x = int(input())
ans = 0
mount = 100
while mount < x:
    mount = floor(mount * 1.01)
    ans += 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
X = int(input())
now = 100
for i in range(10**7):
    now = math.floor(now*1.01)
    if now >= X:
        print(i+1)
        break

Submission status: Accepted

Solution code:
from math import floor

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

Submission status: Accepted

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

now = 100
c = 0
while now<X:
  now += math.floor(now*0.01)
  c += 1
print(c)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

X,= list(map(int, input().split()))
a=100
count=0
while(1):
  a=int(a*1.01)
  count+=1
  if(X<=a):
    print(count)
    exit()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
now = 100
for kek in range(1223123):
	if(now >=x):
		print(kek)
		exit(0)
	now = (now* 101) //100

Submission status: Accepted

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