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:
#!/usr/bin/env python3
import sys


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


# 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
    print(solve(X))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
X = int(input())
cnt = 100
i = 0
while cnt < X:
    cnt += int(str(cnt)[:-2])
    i += 1

print(i)

Submission status: Accepted

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

Submission status: Accepted

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

while 1:
    cnt+=1
    money+=math.floor(money*0.01)
    if money>=x:
        print(cnt)
        exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

X = int(input())

price = 100
year = 0

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

print(year)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = input()

X = int(X)

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

print(count)

Submission status: Accepted

Solution code:
X = int(input())

K = 100

y = 0

while True:
    y += 1
    K += K // 100
    if K >= X:
        break
    
print(y)

Submission status: Accepted

Solution code:
x = int(input())

i = 0
r = 100
while True:
    i += 1
    r = int(1.01 * r)
    if x <= r:
        print(i)
        break

Submission status: Accepted

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

while 1:
    if total >= x:
        print(count)
        break
    total = int(total * 1.01)
    count += 1

Submission status: Accepted

Solution code:
x=int(input())

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

Submission status: Accepted

Solution code:
X = int(input())
k = 0
a = 100
for i in range(100000):
    a = int(a * 1.01)
    k += 1
    if a >= X:
        break
print(k)

Submission status: Accepted

Solution code:
import math
k = int(input())
y = 100
i = 0

while (y<k):
    y = math.floor(y*1.01)
    i += 1

print(i)

Submission status: Accepted

Solution code:
import math
#import heapq
#import itertools
import sys
def input():
    return sys.stdin.readline().rstrip('\n')

def calc(X):
    a = 100
    n = 0
    while a < X:
        a = math.floor(a * 1.01)
        n += 1
    return n


X = int(input())
print(calc(X))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

def next(X):
    return (X*101)//100

year = 0
money = 100
while money < X:
    money = next(money)
    year = year + 1
    
print(year)

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(count)

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
x = int(input())
sum = 100
r = 0.01
for i in range(1, 10**6):
    sum = int(sum*(1 + r))
    if sum >= x:
        print(i)
        break

Submission status: Accepted

Solution code:
x=int(input())
L=[100]+[0]*10**4
for i in range(10000):
    L[i+1]=int(L[i]*1.01)
    if L[i+1]>=x:
        print(i+1)
        exit()

Submission status: Accepted

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

#sum_n = 100*((1.01)**n)
sum_i = 100

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())
cnt=0
money=100
for i in range(1,100000000000000000000000000):
  money=money*1.01//1
  cnt+=1
  if money>=x:
    break
print(cnt)

Submission status: Accepted

Solution code:
import math

X = int(input())

cur = 100
i = 0

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

Submission status: Accepted

Solution code:
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush, nlargest, nsmallest
from math import ceil, floor, gcd, fabs, factorial, fmod, sqrt, inf, log
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from fractions import Fraction
# sys.setrecursionlimit(2*pow(10, 6))
# sys.stdin = open("input.txt", "r")
# sys.stdout = open("output.txt", "w")
mod = pow(10, 9) + 7
mod2 = 998244353
def data(): return sys.stdin.readline().strip()
def out(*var, end="\n"): sys.stdout.write(" ".join(map(str, var))+end)
def l(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]


n = int(data())
initial = 100
i = 1
while True:
    initial += initial//100
    if initial >= n:
        out(i)
        exit()
    i += 1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
def main():
    X = int(input())
    M = 100
    flag = True
    CNT = 0
    while flag == True:
        CNT += 1
        M += int(M*0.01)
        if M >= X:
            flag = False
    print(CNT)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

while s < x:
    s = math.floor(s * 1.01)
    y += 1

print(y)

Submission status: Accepted

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

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

Submission status: Accepted

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

def solve(x: int) -> int:
    y = 100
    for i in itertools.count(1):
        y = y * 101 // 100
        if x <= y:
            return i

# generated by online-judge-template-generator v4.1.0 (https://github.com/kmyk/online-judge-template-generator)
def main():
    X = int(input())
    unz = solve(X)
    print(unz)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

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

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

if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import itertools#これは色々使える組み込み関数みたいなやつ
import fractions
import copy
import bisect
#import math#数学的計算はこれでいける。普通に0.5乗しても計算可能
#w=input()
import math
from operator import itemgetter
from sys import stdin
#input = sys.stdin.readline#こっちの方が入力が早いが使える時に使っていこう
from operator import mul
from functools import reduce
from collections import Counter
#from collections import deque

#input = stdin.readline


N=3
M=3
i=0
j=0
k=0
n=3
r=1
a=[0]*5
b=[]

#s=input()
#a=[int(i) for i in s]

X=int(input())
mo=100
year=0
#r=int(input())
#print(M)
#A=int(input())
#B=int(input())
#print(N)
"1行1つの整数を入力を取得し、整数と取得する"
for i in range(100000000000):
    mo=math.floor(mo*(1.01))
    year+=1
    if mo >= X:
        print(year)
        sys.exit()

#number_list=list(map(int, input().split(" ")))#数字の時
#print(number_list)
"12 21 332 とか入力する時に使う"
"1行に複数の整数の入力を取得し、整数として扱う"

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''
#メモ
for i in number_list:#こっちの方がrage使うより早いらしい
    print(number_list[i-1])#

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''

'''
x=[]
y=[]
for i in range(N):
    x1, y1=[int(i) for i in input().split()]
    x.append(x1)
    y.append(y1)
print(x)
print(y)
"複数行に2数値を入力する形式 x座標とy座標を入力するイメージ"
'''

'''
mixlist=[]
for i in range(N):
    a,b=input().split()
    mixlist.append((int(a),b))
print(mixlist)
"複数行にintとstrを複合して入力するやつ，今回はリスト一つで処理している"
'''

'''
#array=[input().split()for i in range(N)]
#print(type(array[0][0]))
#print(array)
"正方行列にstr型の値を入力"
'''

#brray=[list(map(int, input().split(" ")))for i in range(N)]
#print(type(brray[0][0]))
#print(brray)
'''
入力
1 2
4 5
7 8
出力結果
[[1, 2], [4, 5], [7, 8]]
'''
"列数に関して自由度の高いint型の値を入力するタイプの行列"
#以下に別解を記載
#N, M = [int(i) for i in input().split()]
'''
table = [[int(i) for i in input().split()] for m in range(m)]

print(type(N))
print(N)
print(type(M))
print(M)

print(type(table))
print(table)
'''




#s=input()
#a=[int(i) for i in s]
#print(a[0])
#print([a])
#単数値．桁ごとに分割したい．入力と出力は以下の通り
#イメージとして1桁ごとにリストに値を入れているかんじ

'''
入力
1234
出力
1
[[1, 2, 3, 4]]
'''




'''
word_list= input().split(" ")
print(word_list[0])
"連続文字列の入力"
"qw er ty とかの入力に使う"
"入力すると空白で区切ったところでlistの番号が与えられる"
'''



'''
A, B, C=stdin.readline().rstrip().split()#str style 何個でもいけることが多い
print(A)
"リストではなく独立したstr型を入れるなら以下のやり方でOK"
'''


#a= stdin.readline().rstrip()
#print(a.upper())
"aという変数に入っているものを大文字にして出力"


#a,b=map(int, input().split())  #int style 複数数値入力　「A B」みたいなスペース空いた入力のとき

#なんかうまく入力されるけど
#a=[[int(i) for i in 1.strip()]for 1 in sys.stdin]
#a = [[int(c) for c in l.strip()] for l in sys.stdin]]
#print(a)
#複数行の数値を入力して正方行列を作成


##############################################################################################
##############################################################################################
#under this line explains example calculation

'''
コンビネーションの組み合わせの中身を出力する形式
for i in itertools.combinations(brray, 2)
combinationsをpermutationsにすれば順列になる
今回なら(abc133B)
入力
1 2
5 5
-2 8
出力
[[1, 2], [5, 5], [-2, 8]]
もちろん一次元リストでも使えるし
何よりiもリストのように使えるので便利
'''

#nCr combination
'''
def cmb(n,r):
    #When n < r , this function isn't valid
    r= min(n-r,r)
    #print(n,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n-r, -1))
    #flochart mul(n,n-1)=x
    #next     mul(x,n-2)........(n-r+1,n-r)
    #mul read a,b and returns a*b

    under = reduce(mul, range(1, r+1))
    #print(over, under)
    #reduce is applied mul(1,2)=2
    #next   mul(2,3)=6
    #next   mul(6,4)=4.........last(r!,r+1)=r+1!

    return over // under
    #// is integer divide
    #calc example 5C2
    #over=5*4*3
    #under=3*2*1
a = cmb(n, r)
#print(a)
'''

'''
#集計
#example
#a=[2,2,2,3,4,3,1,2,1,3,1,2,1,2,2,1,2,1]
#a=Counter(a)
for i in a.most_common(n):print(i)
#most_common()メソッドは、出現回数が多い要素順にCounterオブジェクトを並び替えます。
#引数にint型の数字nを設定した場合は、出現回数が高い上位ｎ個の要素を返します。
#何も設定しなければ、コンテナ型にあるすべての要素を出現回数の順番に並び替えたタプル型オブジェクトを返します。
#out put
#(2, 8)
 #(1, 6)
#(3, 3)
#(4, 1)
'''


#二部探索(binary search)
#A = [1, 2, 3, 3, 3, 4, 4, 6, 6, 6, 6]
#print(A)
#index = bisect.bisect_left(A, 5) # 7 最も左(前)の挿入箇所が返ってきている
#A.insert(index, 5)
#print(index)
#print(A)
'''
bisect.bisect_left(a, x, lo=0, h=len(a))
引数
a: ソート済みリスト
x: 挿入したい値
lo: 探索範囲の下限
hi: 探索範囲の上限
(lo, hiはスライスと同様の指定方法)
bisect_leftはソートされたリストaに対して順序を保ったままxを挿入できる箇所を探索します。leftが示す通り、aにすでにxが存在している場合は、挿入箇所は既存のxよりも左側になります。また、lo, hiを指定することで探索範囲を絞り込むことも可能です。デフォルトはaの全体が探索対象です。
'''





########################################################################
########################################################################
#b2=a[:]  #1次元のときはコピーはこれで良い
#print(b2)

#a= [[0]*3 for i in range(5)] #2次元配列はこう準備、[[0]*3]*5だとだめ
#b3=copy.deepcopy(a)  #2次元配列はこうコピーする
#print(b3)

Submission status: Accepted

Solution code:
X=int(input())
i,m=0,100
while m<X:
    m=m*101//100
    i+=1
print(i)

Submission status: Accepted

Solution code:

def main():
    X = int(input())
    yokin = 100
    cnt = 0

    while X > yokin:
        yokin = (int)(yokin*1.01)
        cnt += 1

    print(cnt)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x = int(input());

ans = 1;
a = 100;
while x>int(a*1.01) :
    ans += 1;
    a = int(a*1.01);

print(ans);

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

import math

tyokin = 100
year_count = 0
for i in range(9999):
    tyokin = math.floor(tyokin * 1.01)
    year_count += 1
    
    if tyokin >= X:
        break
        
print(year_count)

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(200000000)

def kane(l,n,m):
    l *= 1.01
    l = l // 1
    n += 1
    if l >= m:
        print(n)
        exit()
    kane(l,n,m)

X = int(input())
kane(100,0,X)

Submission status: Accepted

Solution code:
X=int(input())

A=100
for i in range(100000):
    A = int(A*1.01)
    if A >= X:
        break

print(i+1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

border = int(input()) # 1整数入力

i = 1
X = math.floor(100 * 1.01)
while True:
	if X >= border:
		print(i)
		exit()
	i += 1
	X = math.floor(X * 1.01)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X=int(input())
M=100
k=0
while X>M:
  M=(M*1.01)//1
  k+=1
print(k)

Submission status: Accepted

Solution code:
X = int(input())


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

Submission status: Accepted

Solution code:
import math

X = int(input())

m = 100
i = 0

while m > 99:
    m  = m * 1.01
    m  = math.floor(m)
    i  = i + 1
    if X <= m:
        print(i)
        break

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:
x = int(input())
count = 0
m = 100
while x > m:
    count += 1
    m += m // 100
print(count)

Submission status: Accepted

Solution code:
X = int(input())

P = 100
ans = 0

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

while a < X:
  i += 1
  a += a // 100
  
print(i)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

Solution code:
X = int(input())

m = 100
num = 0

while(m < X):
  m += m * 0.01
  m = int(m)
  num += 1
print(num)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
 
X = INT()
 
a = 100
ans = 0
 
while a < X:
	a = int(1.01*a)
	ans += 1
 
print(ans)

Submission status: Accepted

Solution code:
x = int(input())
tmp = 100
i = 0

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

Submission status: Accepted

Solution code:
# Code for B - 1%
# Use input() to fetch data from STDIN
from math import floor
import sys
x = int(input())

y = 100

for i in range(1000000):
    y = floor(y + y * 0.01)
    if y >= x:
        print(i + 1)

        sys.exit()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float("INF")

#solve
def solve():
    x = II()
    k = 100
    i = 0
    while k < x:
        k *= 1.01
        k = int(k)
        i += 1
    print(i)
    return


#main
if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

print(year)

Submission status: Accepted

Solution code:
X =int(input())
year = 0
yokin = 100

while True:
    yokin = int(yokin+yokin*0.01)
    year += 1

    if yokin >= X:
        print(year)
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#author: raghav_0901
from math import *

mod = (10**9) + 7


def _in():
    return [int(x) for x in input().split(' ')]


if __name__ == "__main__":
    k = int(input())
    curr, cnt = 100, 0
    while(curr < k):
        curr = int(curr * (1.01))
        cnt = cnt + 1
    print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

print(y)

Submission status: Accepted

Solution code:
X = int(input())

balance = 100
year = 0

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

print(year)

Submission status: Accepted

Solution code:
from math import log

X=int(input())
k=1
now = 100
while now*1.01//1<X:
    k+=1
    now*=1.01
    now=now//1

print(k)

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

Solution code:
# AtCoder Beginner Contest 165: B (2020/05/02)
X = int(input())
A = 100
i = 1
while True:
    A = int(A * 1.01)
    if A >= X:
        break
    i = i + 1
print(i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
m=100
co=0
while 1:
    if N>m:
        m=int(m*1.01)
        co+=1
    else:
        print(co)
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def solve():
    X = int(input())
    a = 100

    ans = 0
    if a >= X:
        print(ans)
        return

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

if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

sm = 100
count = 0

while 1:
    count += 1
    sm += int(0.01*sm)
    if sm >= x:
        break

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

K = int(input())

c = 0
a = 100

while(True):
    c = c + 1
    a = math.floor(a*1.01)
    if a >= K:
        break

print(c)

Submission status: Accepted

Solution code:
N=int(input())
i=100
j=1
while 1:
    i=int(i*1.01)
    if i >=N:
        print(j)
        break
    j+=1

Submission status: Accepted

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

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

print(year)

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
def main():
    x = int(input())
    t = 0
    a = 100
    while a < x:
        t += 1
        a = a+a//100
    print(t)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

x = int(input())

INF = 1000000000000000000

a = 100

for i in range(1, INF):
    a = int(a*1.01)
    if a >= x:
        print(i)
        sys.exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
def main():
    x = int(input())
    money = 100
    year = 0
    while money < x:
        year += 1
        money *= 1.01
        money = money//1
    print(year)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

print(ans)

Submission status: Accepted

Solution code:
i = int(input())

ans = 0
total = 100

while total < i:
  total = total + (total//100)
  ans +=1
  #print(total)

print(ans)

Submission status: Accepted

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

print(t)

Submission status: Accepted

Solution code:
a = int(input())

# main

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

# /main
print(i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 標準入力の取得
X = int(input())

# 求解処理
deposit = 100
year = 0
while deposit < X:
    deposit = int(deposit * 1.01)
    year += 1

# 結果出力
print(year)

Submission status: Accepted

Solution code:
import sys
import math
stdin = sys.stdin
     
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

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

print(c)

Submission status: Accepted

Solution code:
import math


def read():
    X = int(input())
    return X,

def solve(X):
    a = 100
    t = 0
    while a < X:
        a = math.floor(a * 1.01)
        t += 1
    return t
    

if __name__ == '__main__':
    inputs = read()
    print("{}".format(solve(*inputs)))

Submission status: Accepted

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

count = 0
while True:
  s = int(s * 1.01)
  count += 1
  if s >= X:
    break
print(count)

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

Solution code:
X = int(input())

i = 100
count = 0

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

year = 0
yen = 100
while not (yen >= X):
    #print(X)
    yen += int(yen*0.01)
    year += 1

print(year)

Submission status: Accepted

Solution code:
import math

x = int(input())

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math


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

    s = 100
    y = 0
    while True:
        s = math.floor(s * 1.01)
        y += 1
        if s >= x:
            break

    print(y)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
import math

x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

x = int(input())
c = 100
for i in range(4000):
    c += c//100
    if c >= x:
        print(i+1)
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

m = 100
cnt = 0

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

Submission status: Accepted

Solution code:
import numpy as np
a=int(input())
n=100
count = 0
while n<a:
  n = int(1.01*n)
  count += 1
  
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k=int(input())
ans=100
y=0
while(1):
    if ans>=k:
        break
    m=(ans)//100 
    ans+=m 
    y+=1
    
print(y)