Problem:


Score : 200 points

Problem Statement

Takahashi has a deposit of 100 yen (the currency of Japan) in AtCoder Bank.

The bank pays an annual interest rate of 1 % compounded annually. (A fraction of less than one yen is discarded.)

Assuming that nothing other than the interest affects Takahashi's balance, in how many years does the balance reach X yen or above for the first time?

Constraints

 101 \le X \le 10^{18} 

All values in input are integers.

Input

Input is given from Standard Input in the following format:

X

Output

Print the number of years it takes for Takahashi's balance to reach X yen or above for the first time.

Sample Input 1

103

Sample Output 1

3

The balance after one year is 101 yen.

The balance after two years is 102 yen.

The balance after three years is 103 yen.

Thus, it takes three years for the balance to reach 103 yen or above.

Sample Input 2

1000000000000000000

Sample Output 2

3760

Sample Input 3

1333333333

Sample Output 3

1706



Sample input:
103


Sample output:
3

Submission status: Accepted

Solution code:
def main(sample_file = ''):

    """ convenient functions
    # for i, a in enumerate(iterable)
    # q, mod = divmod(a, b)
    # divmod(x, y) returns the tuple (x//y, x%y)
    # Higher-order function: reduce(operator.mul, xyz_count, 1)
    # manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc127_f
    """

    """convenient decorator
    # @functools.lru_cache():
    # to facilitate use of recursive function
        # ex:
        # from functools import lru_cache
        # import sys
        # sys.setrecursionlimit(10**9)
        # @lru_cache(maxsize=None)
        # def fib(n):
        #     if n < 2:
        #         return n
        #     return fib(n-1) + fib(n-2)
        # print(fib(1000))
    """
    
    # import numpy as np
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html
    # accumulate() returns iterator! to get list: list(accumulate())
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  # prime factor
        b, e = 2, 0  # base, exponent
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        # TODO: How should I do when n - r is negative?
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict # https://docs.python.org/ja/3/library/collections.html#collections.deque
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html
    from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html
    import operator
    from operator import itemgetter #sort 
    # ex1: List.sort(key=itemgetter(1))
    # ex2: sorted(tuples, key=itemgetter(1,2))
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    # first create factorial_list
    # fac_list = mod_factorial_list(n)
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    AtoZ = list('abcdefghijklmnopqrsruvwxyz')
    modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!
    def modinv(a, p = MOD):
        # evaluate reciprocal using Fermat's little theorem:
        # a**(p-1) is identical to 1 (mod p) when a and p is coprime
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        # fac_list = modfactorial_list(100)
        # print(modcomb(100, 5, modfactorial_list(100)))
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    # Graph: https://en.wikipedia.org/wiki/Directed_graph
    # Bellman-Ford: O(|V||E|). Use this if there exists an edge with negative length in the graph
    # After N steps, the shortest path has converded if there doesn't exist an cycle of edges with negative
    # Watch out: d[N] == d[2*N] doesn't necessarily mean the graph doesn't have negative cycle
    # ref: https://www.youtube.com/watch?v=1Z6ofKN03_Y

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    # initialize variables
        # to initialize list, use [0] * n
        # to initialize two dimentional array:
            # ex) [[0] * N for _ in range(N)]
            # ex2) dp = [[0] * (N+1) for _ in range(W*2)]
    # set inputs
        # put inputs between specific values (almost as quickly)
        # ex) S = [-INF] + [int(r()) for _ in range(A)] + [INF]
        # open(0).read() is sometimes useful:
        # ex) n, m, *x = map(int, open(0).read().split())
        #     min(x[::2]) - max(x[1::2])
        # ex2) *x, = map(int, open(0).read().split())
        #     don't forget to add comma after *x if only one variable is used
    # preprocessing
        # transpose = [x for x in zip(*data)]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]
        # flat = [flatten for inner in data for flatten in inner]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]
    # calculate and output
        # output pattern
        # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6
    """

    # functions to read input
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    # single int: int(r())
    # single string: r()
    # single float: float(r())
    # line int: R()
    # line string: r().split()
    # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]
    # lines int: [R() for _ in range(n)]
    """

    # for test
    if sample_file:
        sys.stdin = open(sample_file)
        
    # ----------------------------------
    # main
    #%%
    X = r_int()
    i = 100
    cnt = 0
    while True:
        cnt += 1
        i = floor(i * 1.01)
        if i >= X:
            print(cnt)
            return
    
    #%%
    # end of main
    # ----------------------------------

    """memo: how to use defaultdict of list
    # initialize
    Dic = defaultdict(list)
    # append / extend
    Dic[x].append(y)
    # three methods for loop: keys(), values(), items()
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    # to make binary digits text
    >>> a = 5
    >>> bin_str_a = format(a, '#06b')
    >>> print(bin_str_a)
    0b0101 # first 2 strings (='0b') indicates it is binary
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
X=int(input())
a=100
for i in range(4000):
  a*=1.01
  a//=1
  if a>=X:
    print(i+1)
    exit()

Submission status: Accepted

Solution code:
X = int(input())

m = 100
ans = 0

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

print(ans)

Submission status: Accepted

Solution code:
import sys
def main():
    x = int(input())
    c = 0
    m = 100
    while True:
        m = (m * 1.01)//1
        c += 1
        if m >= x:
            print(c)
            sys.exit()
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x = int(input())

ret = 0
now = 100

while True:
    now = now + (now // 100)
    ret += 1
    if now >= x:
        print(ret)
        break

Submission status: Accepted

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

while value < x:
    value *= 1.01
    value = int(value)
    count += 1

print(count)

Submission status: Accepted

Solution code:
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase


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


# region fastio

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# endregion

if __name__ == "__main__":
    main()

Submission status: Accepted

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

def one_int():
    return int(input())

def one_str():
    return input()

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

X=one_int()

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

Submission status: Accepted

Solution code:
X = int(input())
XX = 100
Y = 0
while X > XX:
    XX = int(XX * 1.01)
    Y += 1

print(Y)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

X = int(input())

base = 1.01
cur = 100
for i in range(1, 100000000000000):
    cur *= base
    cur = int(cur)
    if cur >= X:
        print(i)
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

X = int(readline())

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

Submission status: Accepted

Solution code:
x = int(input())
#n, m = list(map(int, input().split()))
#a, b = list(map(int, input().split()))
# sy, sx = map(int, input().split())
# gy, gx = map(int, input().split())
money = 100
year = 0
while money < x:
    money *= 1.01
    money = money//1
    year += 1

print(year)

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:
(X, ) = [int(n) for n in input().split()]

N = 100
ans = 0
while N < X:
    N = (N * 101) // 100
    ans += 1

print(ans)

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
X = int(input())
t = 100
for i in range(1, 10000):
  t = int(t * 1.01)
  if t >= X:
    print(i)
    break

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import numpy as np
from collections import deque
x = int(input())
money = 100
year = 0
while x > money:
    money = int(money*1.01)
    year += 1
print(year)

Submission status: Accepted

Solution code:
X=int(input())

M=100
for i in range(1,10**7):
    M=int(M*1.01)
    if M>=X:
        print(i)
        exit()

Submission status: Accepted

Solution code:
import math


X = int(input())
money = 100
result = 0
while money < X:
    result += 1
    money += math.floor(money*0.01)

print(result)

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def resolve():
    x = int(input())
    a = 100
    for i in range(1, 3761):
        a = int(a * 1.01)
        if a >= x:
            print(i)
            break

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
x = int(input())

mon = 100
year = 0
while mon < x:
    profit = int(mon * 0.01)
    mon += profit
    year += 1

print(year)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())
num = 100
count = 0
while True:
    count += 1

    num = num + int(num * 0.01)

    if num >= X:
        break

print(count)

Submission status: Accepted

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

ans = 0
nedan = 100

while True:
    ans += 1

    nedan = nedan + (nedan // 100)

    if X <= nedan:
        break

print(ans)

Submission status: Accepted

Solution code:
from sys import stdin
X = int(stdin.readline().rstrip())
tmp = 100
for i in range(1,5000):
    tmp += int(tmp*0.01)
    if tmp >= X:
        print(i)
        break

Submission status: Accepted

Solution code:
input = raw_input

x = int(input())

cur = 100
out = 0

while cur < x:
    cur = int(cur * 1.01)
    out += 1

print(out)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())
x = 100
count = 0
for i in range(10**18):
    x = int(x*1.01)
    count += 1
    if x>=X:
        print(count)
        break

Submission status: Accepted

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

while 1:
  if x>=d:
    print(ans);exit()
  ans+=1
  x+=x//100

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

m = 100

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

Submission status: Accepted

Solution code:
import math
X = int(input())
c = 100
cnt = 0

while True:
    cnt += 1
    c = math.floor(c*1.01)
    if X <= c:
        print(cnt)
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7
#s=input().rstrip()

x=I()
pr=100
for i in range(100000):
    pr=int(pr*1.01)
    if pr>=x:
        print(i+1)
        sys.exit()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#%% for atcoder uniittest use
import sys
input= lambda: sys.stdin.readline().rstrip()
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
#%%code
def resolve():
    N,=pin()
    temp=100
    for i in range(1,1000000):
        temp=(temp*1.01)//1
        #print(temp)
        if temp>=N:
            print(i)
            break
#%%submit!
resolve()

Submission status: Accepted

Solution code:
x = int(input())

year = 0
n = 100

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

print(year)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())

money=100
cnt=0
while(True):
    risi = money // 100
    money+=risi
    cnt+=1
    if money>=x:
        print(cnt)
        exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# cook your dish here


def compound_interest(principle, rate, time): 
  
    # Calculates compound interest  
    CI = int(principle * (pow((1 + rate / 100), time)))
    return CI
    
x=int(input())
principle=100
res=0
while principle<x:
    principle=compound_interest(principle,1,1)
    res+=1
print(res)
    #m,k=map(int,input().split())
    #arr=list(map(int,input().split()))

Submission status: Accepted

Solution code:
x = int(input())

ans = 0
_x = 100
while _x < x:
    _x = _x * 1.01 // 1
    ans += 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

@author: Kanaru Sato
"""

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

while yokin < x:
    count += 1
    yokin *= 1.01
    yokin = int(yokin)
    
print(count)

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(100000):
    m = int(m*1.01)
    year += 1
    if m >= x:
        print(year)
        exit()

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
x = int(input())
#a,b = map(int,input().split())
#a_L = list(map(int,input().split()))

y = 100
a = 1
while True:
    y = int(y*1.01)
    if y >= x:
        #print(y,x)
        print(a)
        exit()
    a += 1

Submission status: Accepted

Solution code:
X = int(input())
R = 100
ans = 0
for i in range(1, 5000):
    R *= 1.01
    R = int(R)
    if X <= R:
        ans = i
        break
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import floor

def main():
    X=int(input())
    tmp=100
    for year in range(1,4000):
        tmp *= 1.01
        tmp = floor(tmp)
        if tmp >= X:
            print(year)
            exit()

main()