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


x = int(input())

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0
while True:
    cnt += 1
    m += m // 100
    if m >= X:
        print(cnt)
        break

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
x = int(input())
ans = 1
m = 100
while True:
    m = int(m * 1.01)
    if m >= x:
        print(ans)
        exit()
    else:
        ans += 1

Submission status: Accepted

Solution code:
import math

x = int(input())
p = 100

i = 1
while True:
    p = math.floor(p * 1.01)
    if p >= x:
        print(i)
        exit()
    i += 1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:

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



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import bisect,sys
import math
from collections import deque

def sRaw():
    return input().rstrip("\r")


def iRaw():
    return int(input())


def ssRaw():
    return input().split()


def isRaw():
    return list(map(int, ssRaw()))

INF = 1 << 29

DIV = (10**9) + 7

def mod_inv_prime(a, mod=DIV):
    return pow(a, mod-2, mod)


def mod_inv(a, b):
    r = a
    w = b
    u = 1
    v = 0
    while w != 0:
        t = r//w
        r -= t*w
        r, w = w, r
        u -= t*v
        u, v = v, u
    return (u % b+b) % b


def CONV_TBL(max, mod=DIV):
    fac, finv, inv = [0]*max, [0]*max, [0]*max
    fac[0] = fac[1] = 1
    finv[0] = finv[1] = 1
    inv[1] = 1
    for i in range(2, max):
        fac[i] = fac[i-1]*i % mod
        inv[i] = mod - inv[mod % i] * (mod//i) % mod
        finv[i] = finv[i-1]*inv[i] % mod

    class CONV:
        def __init__(self):
            self.fac =fac
            self.finv = finv
            pass

        def ncr(self, n, k):
            if(n < k):
                return 0
            if(n < 0 or k < 0):
                return 0
            return fac[n]*(finv[k]*finv[n-k] % DIV) % DIV
        
    return CONV()



sys.setrecursionlimit(200005)


def main():
    X = iRaw()
    a = 100
    year= 0
    while a<X:
        a = int(a*1.01)
        year+=1
    return year

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

Submission status: Accepted

Solution code:
a = 100
x = int(input())
i = 0
while True:
    if x <= a:
        break

    i += 1
    a = (a * 1.01) // 1

print(i)

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

    amount = 100
    answer = 0

    while True:
        if amount >= X: break
        answer += 1
        amount = int(amount * 1.01)

    print(answer)



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import time
import math
k=int(input())
a=100
c=0
while a <k:
    a*=1.01
    a =int(a)
    c+=1
print(c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())

m=100
year = 0
while m<x:
    m*=1.01
    m=m//1
    year += 1

print(year)

Submission status: Accepted

Solution code:
X = int(input())

depo = 100
ans = 0

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

print(ans)

Submission status: Accepted

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

def solve(X: int):
    N = 100
    i = 0
    while N < X:
        N = math.floor(N*1.01)
        i += 1
    print(i)
    return


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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math

X = int(input())

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

print(ans)

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
# coding:utf-8
import math
x = int(input())
yen = 100
year = 0

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

print(year)

Submission status: Accepted

Solution code:
x=int(input())
a=100
num=0
while True:
    if(x<=a):
        break
    a+=int(0.01*a)
    num+=1

print(num)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


def main():
     X=int(input())
     i = 100
     x = 0
     while i < X:
          to_add = i//100
          i += to_add
          x += 1
     print(x)
                    
main()

Submission status: Accepted

Solution code:
import math
import fractions
import collections
import itertools
X=int(input())
num=100
year=0
for i in range(4000):
    if num>=X:
        year=i
        break
    else:
        num=int(num*1.01)
    #print(num)
    #input()
print(year)

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
# 再起回数上限変更
# sys.setrecursionlimit(1000000)

import math

X = int(input())
N = 10**8

a = 100
ans = 0
for i in range(N):
    a = math.floor(a * 1.01)
    ans += 1
    if a >= X:
        print(ans)
        sys.exit()

Submission status: Accepted

Solution code:
n = int(input())
a = 100
for i in range(1, 10**9+7):
    a = int(1.01*a)
    if n <= a:
        print(i)
        exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def resolve():
    '''
    code here
    '''

    X = int(input())

    is_flag = True
    x = 100
    cnt = 0
    while is_flag:
        cnt += 1
        x *= 1.01
        x = int(x)
        if x >= X:
            is_flag = False

    print(cnt)

if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
X = int(input())

tmp = 100
cnt = 0
while tmp < X:
    tmp = tmp + int(tmp*0.01)
    cnt += 1

print(cnt)

Submission status: Accepted

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


# 入力を整数に変換して受け取る
def input_int():
    return int(input())


# マイナス1した値を返却
def int1(x):
    return int(x) - 1


# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
    return map(int, input().split())


# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
    return tuple(map(int, input().split()))


# 半角スペース区切り入力をIntに変換してマイナス1した値を受け取る
def input_to_int_tuple_minus1():
    return tuple(map(int1, input().split()))


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

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

    return year


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

Submission status: Accepted

Solution code:
X = int(input())

t = 100
result = 0
while t < X:
    t += t // 100
    result += 1
print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

def main():
    x = ni()

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())
yen=100
nen=0
while(1):
    nen+=1
    yen=int(yen*1.01)
    if yen>=k:
        print(nen)
        break

Submission status: Accepted

Solution code:
x=int(input())
t=100
i=0
while True:
    i+=1
    m = t * 101
    m //= 100
    t = m
    if t>=x:
        print(i)
        exit(0)

Submission status: Accepted

Solution code:
def resolve():
    x = int(input())
    base = 100
    i = 1
    while True:
        base += base // 100
        if base >= x:
            print(i)
            break
        i += 1

resolve()

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    x = int(input())
    y = 100
    z = 0
    while y < x:
        z += 1
        y = y * 101 // 100
    return z


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

Submission status: Accepted

Solution code:
def main():
    x = int(input())
    ans = solve(x)
    print(ans)


def solve(x):
    c = 100
    ans = 0
    while c < x:
        ans += 1
        c = int(c * 1.01)
    return ans


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
X = int(input())

k = 100
rate = 1.01

ans = 0
while k < X:
    k = k * rate // 1
    ans += 1
print(ans)

Submission status: Accepted

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


def main():
    a = 100
    p = 1.01
    X = int(input().rstrip())
    i = 0
    while True:
        i += 1
        a = int(a * p)
        if a >= X:
            print(i)
            break


if __name__  == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import collections
import itertools as it
import math
#import numpy as np
 
#  = input()
x  = int(input())
#  = map(int, input().split())
#  = list(map(int, input().split()))
#  = [int(input()) for i in range(N)]
#
# c = collections.Counter()

yokin = 100
for i in range(10**18):
    yokin += int(yokin*0.01)

    if yokin >= x:
        print(i+1)
        break

Submission status: Accepted

Solution code:
X = int(input())
ans = 0
yokin = 100
for i in range(1,10 ** 18):
    yokin = int(yokin * 1.01)
    if yokin >= X:
        print(i)
        exit(0)

Submission status: Accepted

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

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

Submission status: Accepted

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

k = 100
count = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
c = 100
k = int(input())
i = 0
while c<k:
    c = int(c*1.01)
    i += 1
print(i)

Submission status: Accepted

Solution code:
import math

n = int(input())

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

print(i)

Submission status: Accepted

Solution code:
X = int(input())

# import math
# print(math.log10(X)/math.log10(2))
a = 100
for i in range(1000000):
    a = int(a * 1.01)
    if a >= X:
        print(i+1)
        exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import floor

x = int(input())
n = 100

ans = 0
while n < x:
	n = floor(n * 1.01)
	# print("n", n)
	ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
X = int(input())
yen = 100
for i in range(1,1000000):
  yen = math.floor(yen * 1.01)
  if yen >= X:
    print(i)
    exit(0)

Submission status: Accepted

Solution code:
import math

X = int(input())

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

Submission status: Accepted

Solution code:
import math
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    x=int(input())
    yokin=100
    cnt=0
    while yokin<x:
        yokin+=math.floor(yokin*0.01)
        cnt+=1
    print(cnt)
resolve()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import sys

x=int(input())
i=0
shojikin=100
while True:
    i+=1
    shojikin=math.floor(shojikin*1.01)
    if shojikin >= x:
        print(i)
        sys.exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())
ans=0
a=100
while a<x:
    a = int(a*1.01)
    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 = year + 1

print( year )

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

import math

bank = 100
year = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

num = 100
y = 0

while num < x:
    num = (num*1.01)//1
    y += 1
print(y)

Submission status: Accepted

Solution code:
import sys
from math import sqrt
from collections import Counter, defaultdict, deque

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)


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


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


def LI():
    return list(MI())


def LIN(n: int):
    return [I() for _ in range(n)]


inf = float("inf")
mod = 10 ** 9 + 7


def main():
    x = I()

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys,math,copy,queue,itertools,bisect,collections,heapq
sys.setrecursionlimit(10**7)
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
INF = 10**18
MOD = 10**9 + 7
DD = ((1,0),(-1,0),(0,1),(0,-1))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

x = int(input())


def solve():
    ans = 100
    count = 0

    for i in range(1000000):
        ans = math.floor(ans * 1.01)
        if(ans >= x ):
            return i
    return -1


print(solve() + 1)

Submission status: Accepted

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

print(year)

Submission status: Accepted

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

cnt = 100
ans = 0
for i in range(10000):
    cnt = math.floor(cnt * 1.01)
    ans += 1
    if cnt >= X:
        print(ans)
        break

Submission status: Accepted

Solution code:
n = int(input())
coin = 100
year = 0

while coin < n:
  coin = int(coin*1.01)
  year += 1
  
print(year)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

x = int(input())
a = 100

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

Submission status: Accepted

Solution code:
X = int(input())

tmp = 100
cnt = 0

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

Submission status: Accepted

Solution code:
# B - 1%

X = int(input())
cur = 100

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

print(ans)

Submission status: Accepted

Solution code:
import sys
n = int(sys.stdin.readline())
m = 100
i = 1
while int(m*1.01) < n:
  m = int(m*1.01)
  i += 1
print(i)

Submission status: Accepted

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

import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7

X = INT()

cur = 100
ans = 0
while cur < X:
    cur = cur * 1.01 // 1
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def input_one_number():
    return int(input())

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

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

X = input_one_number()

m = 100

cnt = 0
while True:
	if X <= m:
		print(cnt)
		exit(0)

	m = (m * 1.01)//1
	cnt +=1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/bin/bash
''':'
docker run --rm -it -v $(cd $(dirname $0) && pwd):/vo:ro pypy:3-2.4.0 \
   /bin/bash -c "pypy3 /vo/$(basename $0) < /vo/input.txt"
exit $?
'''
import sys

def _i(): return int(sys.stdin.readline().strip())


def main():
    x = _i()
    cur = 100
    cnt = 0
    while True:
        cur = int(cur*1.01)
        cnt += 1
        if x <= cur:
            return cnt

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

Submission status: Accepted

Solution code:
# coding: utf-8
import re
import math
from collections import defaultdict
import itertools
from copy import deepcopy
import random
from heapq import heappop,heappush
import time
import os
import queue
import sys
import datetime
from functools import lru_cache
#@lru_cache(maxsize=None)
readline=sys.stdin.readline
sys.setrecursionlimit(2000)
#import numpy as np
alphabet="abcdefghijklmnopqrstuvwxyz"
mod=int(10**9+7)
inf=int(10**20)
def yn(b):
    if b:
        print("yes")
    else:
        print("no")
def Yn(b):
    if b:
        print("Yes")
    else:
        print("No")
def YN(b):
    if b:
        print("YES")
    else:
        print("NO")
class union_find():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(N)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def is_power(a,b):#aはbの累乗数か
    now=b
    while now<a:
        now*=b
    if now==a:return True
    else:return False
def bin_(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def get_facs(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def next_comb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:
        return num
def get_primes(n,type="int"):
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    if(type=="bool"):return A
    B=[]
    for a in range(n+1):
        if(A[a]):B.append(a)
    return B
def is_prime(num):
    if(num<=2):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def ifelse(a,b,c):
    if a:return b
    else:return  c
def join(A,c=" "):
    n=len(A)
    A=list(map(str,A))
    s=""
    for a in range(n):
        s+=A[a]
        if(a<n-1):s+=c
    return s
def factorize(n,type_="dict"):
    b = 2
    list_ = []
    while b * b <= n:
        while n % b == 0:
            n //= b
            list_.append(b)
        b+=1
    if n > 1:list_.append(n)
    if type_=="dict":
        dic={}
        for a in list_:
            if a in dic:
                dic[a]+=1
            else:
                dic[a]=1
        return dic
    elif type_=="list":
        return list_
    else:
        return None
def floor_(n,x=1):
    return x*(n//x)
def ceil_(n,x=1):
    return x*((n+x-1)//x)
def hani(x,min_,max_):
    ret=x
    if x<min_:ret=min_
    if x>max_:ret=max_
    return ret
def seifu(x):
    return x//abs(x)
###################################################
def main():
    x=int(input())
    now=100
    ans=0
    while now<x:
        now*=1.01
        now//=1
        ans+=1
    print(ans)

main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
	X = int(input())
	y = 0
	m = 100
	while m < X:
		m = m + (m//100)
		y += 1
	print(y)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
a = 100
c = 0
#a,b = list(map(int, input().split()))
while x > a:
    a = int(a*1.01)
    c += 1
print(c)

Submission status: Accepted

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