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:
mod = 10**9+7
import sys
from collections import Counter, defaultdict, deque
from itertools import product, permutations, combinations
from itertools import accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from math import ceil,floor
from copy import deepcopy
from heapq import heappop,heappush,heapify
import heapq


# l = ['a', 'a', 'a', 'a', 'b', 'c', 'c']
# c = Counter(l)

# d = defaultdict(int)

sys.setrecursionlimit(10 ** 6)

int1 = lambda x: int(x) - 1

# リストの要素を改行を挟んで表示する
p2D = lambda x: print(*x, sep="\n")
# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())

def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())

# 入力全てを整数に変換したものの配列を受け取る
# def LI(): return list(map(int, sys.stdin.readline().split()))
# 入力全てを整数に変換して1引いたものの配列を受け取る
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI(): return list(map(lambda x:int(x), sys.stdin.readline().split()))
def HI(): return list(map(lambda x:int(x)*(-1), sys.stdin.readline().split()))



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

Submission status: Accepted

Solution code:
X = int(input())

dyear = 0
price = 100

while price < X:
    dyear += 1
    price = int(price * 1.01)
print(dyear)

Submission status: Accepted

Solution code:
goal = int(input())

x=100
n=0
while True:
  t=int(x*0.01)
  x+=t
  n+= 1
  if x >= goal:
    break

print(n)

Submission status: Accepted

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

azuke = 100
ans = 0
while True:
    azuke = int(azuke*1.01)

    ans += 1
    if azuke >= X:
        print(ans)
        exit(0)

Submission status: Accepted

Solution code:
X=int(input())

ans=0
tmp=100
while(1):
    if tmp>=X:
        break
    tmp=tmp+tmp//100
    ans+=1
print(ans)

Submission status: Accepted

Solution code:
from sys import stdin
import math

if __name__ == "__main__":
    _in = [_.rstrip() for _ in stdin.readlines()]
    X = int(_in[0])  # type:int
    # vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
    yen = 100
    cnt = 0
    while (yen<X):
        yen = math.floor(yen*1.01)
        cnt += 1
    # ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
    print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

for y in range(10000):
    if m >=X:
        print(y)
        break
    m = int(m*1.01)

Submission status: Accepted

Solution code:
import sys

x = int(input())

year = 0

depos = 100

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

print(year)

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())

years = 0
money = 100
while(True) :
    years += 1
    money += int(money * 0.01)
    if (X <= money) :
        break

print(years)

Submission status: Accepted

Solution code:
x=int(input())

m=100

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

Submission status: Accepted

Solution code:
x = int(input())

tmp = 100
for i in range(10 ** 20):
    if tmp >= x:
        print(i)
        exit()
    tmp = int(tmp * 1.01)

Submission status: Accepted

Solution code:
from math import gcd

from math import factorial as f

from math import ceil,floor,sqrt


import bisect
import re
import heapq


from copy import deepcopy
import itertools

from sys import exit

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

yes = "Yes"
no = "No"

def main():
    x = ii()
    cnt = 0
    tmp = 100
    while tmp<x:
        tmp+=tmp//100
        cnt+=1
    print(cnt)




main()

Submission status: Accepted

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

    
if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# B - 1%

X = int(input())

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

print(ans)

Submission status: Accepted

Solution code:
X = int(input())
import math
ans = 0
y = 100

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

Submission status: Accepted

Solution code:
from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations # (string,3) 3回
from collections import deque
from collections import defaultdict
import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def main():
    X = int(input())
    m = 100
    cnt = 0
    while True:
        #print(m)
        if m >= X:

            print(cnt)
            exit()
        else:
            m = int(m * 1.01)
            cnt += 1

if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:

def main():
    cost = 100
    X = int(input())
    y = 0
    while(cost < X):
        cost = int(cost * 1.01)
        y += 1
    print(y)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1000000000)
import math
from math import gcd
def lcm(a, b): return a * b // gcd(a, b)
from itertools import count, permutations, chain
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok

def get_inv(n, modp):
    return pow(n, modp-2, modp)

def factorials_list(n, modp):    # 10**6
    fs = [1]
    for i in range(1, n+1):
        fs.append(fs[-1] * i % modp)
    return fs

def invs_list(n, fs, modp):     # 10**6
    invs = [get_inv(fs[-1], modp)]
    for i in range(n, 1-1, -1):
        invs.append(invs[-1] * i % modp)
    invs.reverse()
    return invs

def comb(n, k, modp):
    num = 1
    for i in range(n, n-k, -1):
        num = num * i % modp
    den = 1
    for i in range(2, k+1):
        den = den * i % modp
    return num * get_inv(den, modp) % modp

def comb_from_list(n, k, modp, fs, invs):   
    return fs[n] * invs[n-k] * invs[k] % modp

#

class UnionFindEx:
    def __init__(self, size):
        #正なら根の番号、負ならグループサイズ
        self.roots = [-1] * size
    def getRootID(self, i):
        r = self.roots[i]
        if r < 0:   #負なら根
            return i
        else:
            r = self.getRootID(r)
            self.roots[i] = r
            return r
    def getGroupSize(self, i):
        return -self.roots[self.getRootID(i)]
    def connect(self, i, j):
        r1, r2 = self.getRootID(i), self.getRootID(j)
        if r1 == r2:
            return False
        if self.getGroupSize(r1) < self.getGroupSize(r2):
            r1, r2 = r2, r1
        self.roots[r1] += self.roots[r2]    #サイズ更新
        self.roots[r2] = r1
        return True

Yes = 'Yes'
No = 'No'


def main():
    m = 100
    X=ii()
    for i in count(1):
        m += (m//100)
        if m >= X:
            print(i)
            return


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush,heapify
import math
from copy import deepcopy
import queue
#import sympy as syp(素因数分解とか)
Mod = 1000000007
  
def sieve_of_eratosthenes(n):
    if not isinstance(n,int):
        raise TypeError("n is not int")
    if n<2:
        raise ValueError("n is not effective")
    prime = [1]*(n+1)
    for i in range(2,int(math.sqrt(n))+1):
        if prime[i] == 1:
            for j in range(2*i,n+1):
                if j%i == 0:
                    prime[j] = 0
    res = []
    for i in range(2,n+1):
        if prime[i] == 1:
            res.append(i)
    return res

 
class UnionFind:
    def __init__(self,n):
        self.parent = [i for i in range(n+1)]
        self.rank = [0 for i in range(n+1)]
    
    def findroot(self,x):
        if x == self.parent[x]:
            return x
        else:
            y = self.parent[x]
            y = self.findroot(self.parent[x])
            return y
    
    def union(self,x,y):
        px = self.findroot(x)
        py = self.findroot(y)
        if px < py:
            self.parent[py] = px
        else:
            self.parent[px] = py
 
    def same_group_or_no(self,x,y):
        return self.findroot(x) == self.findroot(y)

def main():  #startline-------------------------------------------
    mon = 100
    ans = 0
    x = int(input())
    while mon < x:
        mon *= 1.01
        mon = math.floor(mon)
        ans += 1
    print(ans)
if __name__ == "__main__":
    main() #endline===============================================

Submission status: Accepted

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


def solve(X: int):
    n = 100
    e =  0
    while (n < X):
        n = int(1.01*n)
        e += 1
    print(e)
    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())
money = 100
count = 0
while money<x:
    money=int(money*1.01)
    count+=1
print(count)

Submission status: Accepted

Solution code:
def main():
    x = int(input())
    k = 0
    y = 100
    for i in range(100000000):
        k = k + 1
        hukuri = int(y * 0.01)
        y = y + hukuri
        if y >= x:
            print(k)
            break
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import math
import fractions
from collections import deque
from collections import defaultdict
sys.setrecursionlimit(10**7)

X = int(input())

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

print(cnt)

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import heapq
from collections import defaultdict, deque
from math import ceil, factorial, gcd
from itertools import accumulate, permutations
import sys
import bisect

sys.setrecursionlimit(10 ** 7)
INF = float("inf")
MOD = 10 ** 9 + 7

si = lambda: input().strip()
ii = lambda: int(input())
mii = lambda: map(int, input().split())
msi = lambda: map(str, input().split())
lmii = lambda: list(map(int, input().split()))
lmsi = lambda: list(map(str, input().split()))
smii = lambda: sorted(map(int, input().split()))

# ----------

x = ii()

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

print(i)

Submission status: Accepted

Solution code:
x = int(input())

a = 100
ans = 0

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

print(ans)

Submission status: Accepted

Solution code:
import sys
X = int(sys.stdin.readline())
T = 100
ans = 0
while T < X:
    T = int(T * 1.01)
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
import sys
import math
import bisect
# import copy
# import heapq
# from collections import deque
# import decimal

# sys.setrecursionlimit(100001)
INF = sys.maxsize
MOD = 10 ** 9 + 7


# ===CODE===
moto = 100
rishi = 1.01
k = int(input())

cnt = 0
while True:
    cnt += 1
    moto = int(float(moto)*rishi)
    if moto >= k:
        print(cnt)
        exit(0)

Submission status: Accepted

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

Submission status: Accepted

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

from pprint import pprint
from collections import deque, defaultdict
import sys

sys.setrecursionlimit(10 ** 6)
input = sys.stdin.buffer.readline
INF = float("inf")

x = int(input())
year = 0
money = 100
while True:
    year += 1
    money += money // 100
    if money >= x:
        break

print(year)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

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

print(y)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(counter)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
from math import floor

X = int(input())

year = 0
money = 100

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

print(year)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():

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

resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin
inf = 1 << 60
mod = 1000000007

ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

x = ni()

ans = 0
res = 100
while res < x:
    res += res // 100
    ans += 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

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

print(cnt)

Submission status: Accepted

Solution code:
x=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

while num < x:
    num += int(0.01*num)
    count += 1

print(count)

Submission status: Accepted

Solution code:
n=int(input())

i=1
v=100
while 1:
    v=int(v*1.01)

    if v>=n:
        print(i)
        exit()
    i+=1

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:



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

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

Submission status: Accepted

Solution code:
X=int(input())

ans=100
now=100
cnt=0
while(True):
  if X<=now:
    break
  else:
    now=int(now+now*0.01)
    cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
X = int(input())

c = 100
ans = 0

while c<X:
    ans += 1
    c += int(c*0.01)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)


X = int(readline().rstrip())

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

Submission status: Accepted

Solution code:

from math import floor
X = int(input())
S = 100
for i in range(1, 10**6):
    S = floor(S * 1.01)
    if S >= X:
        print(i)
        exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())
balance = 100
years = 0
while True:
    years += 1
    balance = balance * 101 // 100
    if balance >= X:
        print(years)
        break

Submission status: Accepted

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

    tmp = 100
    ans = 0
    while tmp < x:
        ans += 1
        tmp = tmp * 101 // 100

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

print(c)

Submission status: Accepted

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

count = 0
while True:
  count += 1
  Y = math.floor(Y*1.01)
  if Y >= X:
    print(count)
    break

Submission status: Accepted

Solution code:
import math
b=int(input())
a=100
#n,k=map(int,input().split())
i=0
while True:
    i+=1
    a=int(a*1.01)
    if a>=b:
        print(i)
        exit()

#items=[int(i) for i in input().split()]

#items=[i for i in range(n+1)]

Submission status: Accepted

Solution code:
X = int(input())
n = 100
for k in range(1000000000):
    n = int(n*1.01)
    if n >= X:
        print(k+1)
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

money = 100
ans = 0
while money < x:
    ans += 1
    money *= 101
    money //= 100

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())
ans = 100
i = 0
while True:
    i += 1
    ans = ans * 1.01 
    ans = int(ans)
    if ans >= k:
        print(i)
        quit()

Submission status: Accepted

Solution code:
def main():
    X = int(input())
    current = 100
    for i in range(10000):
        if current >= X:
            print(i)
            return
        current = current * 101 // 100


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import math

x = int(input())
start = 100
count = 0
while(start < x):
  add= math.floor(start*0.01)
  start+=add
  count+=1
print(count)

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10, gcd
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
#from fractions import gcd
def debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 1, 0, -1, 1, -1, -1, 1]
dy = [1, 0, -1, 0, 1, -1, 1, -1]
debugmode = True

x = INT()
a = 100
for i in range(100000):
    a *= 1.01
    a = int(a)
    if a >= x:
        print(i + 1)
        exit()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(1,4000):
    y = int(y*1.01)
    if x <= y:
        print(i)
        break

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10000000)


def main():
    X = int(input())
    a = 100
    year = 0
    while(True):
        a = int(a * 1.01)
        year += 1
        if a >= X:
            print(year)
            sys.exit()


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

x = ii()
ans = 0
ima = 100
while True:
    ans += 1
    ima = int(ima*1.01)
    if x <= ima:
        print(ans)
        exit()

Submission status: Accepted

Solution code:
import math

x = int(input())

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

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 sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

X = int(input())

A = 100
cnt = 0

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

print(cnt)

Submission status: Accepted

Solution code:
X = int(input())

ans = 0
total = 100
while True:
    ans += 1
    total += total // 100
    if total >= X:
        print(ans)
        exit()

Submission status: Accepted

Solution code:
X = int(input())


times = 0
val = 100
while(1):
    val = int(val * 1.01)
    times += 1

    if val >= X:
        break

print(times)

Submission status: Accepted

Solution code:
x=int(input())
co=1
a=100

while 1:
    a=int(a*1.01)
    if a>=x:
        print(co)
        exit()
    co+=1

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(x):
    res = 0
    v = 100
    while True:
        v = int(v * 1.01)
        res += 1
        if v >= x:
            return res


def main():
    x = int(input())
    res = solve(x)
    print(res)


def test():
    assert solve(103) == 3
    assert solve(1000000000000000000) == 3760
    assert solve(1333333333) == 1706


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X=int(input())

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

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


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

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

    print(count)


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
X = int(input())

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

print(cnt)

Submission status: Accepted

Solution code:
import sys


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


def main():
    X = int(input())
    T = 100
    cnt = 0
    while T < X:
        T += T // 100
        cnt += 1
    print(cnt)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
mod = 1000000007
eps = 10**-9


def main():
    import sys
    import math
    input = sys.stdin.readline

    x = int(input())

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

s = 100.0
n = 0
while s < x:
    s = int(s * 1.01)
    n += 1
print(n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#設定
import sys
input = sys.stdin.buffer.readline

#ライブラリインポート
from collections import defaultdict

con = 10 ** 9 + 7
#入力受け取り
def getlist():
	return list(map(int, input().split()))

#処理内容
def main():
	X = int(input())
	var = 100
	for i in range(4000):
		var = int(var * 1.01 // 1)
		if var >= X:
			print(i + 1)
			return

	


if __name__ == '__main__':
	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

money = 100
n = 0
while money < x:
    n += 1
    money *= 1.01
    money //= 1

print(n)

Submission status: Accepted

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

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())
cnt=0
a=100

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