Problem:


Score : 200 points

Problem Statement

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

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

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

Constraints

 101 \le X \le 10^{18} 

All values in input are integers.

Input

Input is given from Standard Input in the following format:

X

Output

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

Sample Input 1

103

Sample Output 1

3

The balance after one year is 101 yen.

The balance after two years is 102 yen.

The balance after three years is 103 yen.

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

Sample Input 2

1000000000000000000

Sample Output 2

3760

Sample Input 3

1333333333

Sample Output 3

1706



Sample input:
103


Sample output:
3

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X=int(input())

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 8)

input = sys.stdin.readline


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

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

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    X=int(input())
    z=100
    for i in range(1,10000):
        z=int(z*1.01)
        if z>=X:
            print(i)
            exit()
    

if __name__ == '__main__':
    main()

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
from itertools import accumulate, permutations, combinations, product
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()

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

print(ans)

Submission status: Accepted

Solution code:
X = int(input())

tmp = 100
count = 0
while tmp < X:
    tmp = (tmp * 101) // 100
    count += 1

print (count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
x = int(input())
tmp = 100
count = 0
for i in range(3800):
         tmp = int(tmp * 1.01)
         count += 1
         if tmp >= x:
                  print(count)
                  exit()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

Solution code:
from math import *
x = int(input())
a = 0
cur = 100
while cur < x:
	cur = int(cur * 1.01 + 10**-7)
	a+=1
print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
yokin = 100
ans = 1

while True:
    yokin = yokin * 1.01 // 1

    if yokin >= x:
        break

    ans = ans + 1

print(ans)

Submission status: Accepted

Solution code:
import math

X = int(input())
a = 100
n = 0
while True:
    n += 1
    a = math.floor(a * 1.01)
    if a >= X:
        print(n)
        exit()

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

def main():
    n = 100
    x = inp()
    ans = 0
    while n < x:
        n *= 1.01
        n = int(n)
        ans += 1
    print(ans)
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
X = int(input())

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

print(i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:

X = int(input())

cnt = 0
now = 100

while now < X:

    now = int( now * 1.01 )
    cnt += 1

print (cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def examA():
    K = I()
    A, B = LI()
    for i in range(A,B+1):
        if i%K==0:
            print("OK")
            return
    print("NG")
    return

def examB():
    X = I()
    now = 100
    ans = 0
    while(now<X):
        ans += 1
        now += now//100
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

import sys,bisect,itertools,heapq,math,random
from copy import deepcopy
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def I(): return int(readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]

sys.setrecursionlimit(10**7)

if __name__ == '__main__':
    examB()

"""
142
12 9 1445 0 1
asd dfg hj o o
aidn
"""

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

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

Submission status: Accepted

Solution code:
import sys

def solve():
    input = sys.stdin.readline
    X = int(input())
    now = 100
    for i in range(1, 10 ** 18):
        now = int(now * 1.01)
        if now >= X:
            print(i)
            break

    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input=lambda: sys.stdin.readline().rstrip()
x=int(input())
t=1
cur=100
while cur<x:
  cur=int(cur*1.01)
  if cur>=x:
    print(t)
    break
  else:
    t+=1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
now = 100
for i in range(40000):
  now = int(now*1.01)
  if now >= n:
    print(i+1)
    break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    x = I()
    y = 100
    for i in range(1,5000):
        y = int(y*1.01)
        if y >= x:
            print(i)
            return
    return

#Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

ans=0
c=100
while 1:
    if c>=x:
        print(ans)
        exit()
    c += int(c*0.01)
    ans+=1

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:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

X = int(input())
ans = 0
N = 100

while N < X:
    ans += 1
    N += N // 100

print(ans)

Submission status: Accepted

Solution code:
from sys import stdin
from sys import setrecursionlimit

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

Submission status: Accepted

Solution code:
x = int(input())

now = 100
ans = 0
while True:
    ans += 1
    now = now * 1.01 // 1
    if now >= x:
        print(ans)
        exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
def pri(x): print('\n'.join(map(str, x)))

X = int(input())
v = 100

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


print(cnt)

Submission status: Accepted

Solution code:
x = int(input())

year = 0
m = 100
while True:
    if m >= x:
        break
    m = m*1.01
    m = m//1
    year += 1

print(year)

Submission status: Accepted

Solution code:
def Int():
    return int(input())
def Ints():
    return map(int,input().split())
def IntList():
    return list(Ints())
def IntMat(N):
    return [IntList() for i in range(N)]

now = 100
ans = 0
X = Int()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  x=I()
  a=100

  ans=1
  while True:
    a*=1.01
    a=int(a)
    if a>=x:
      return ans
    ans+=1

# main()
print(main())

Submission status: Accepted

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

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

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

print(j)

Submission status: Accepted

Solution code:
X=int(input())
NOW=100
for i in range(10**7):
    if NOW>=X:
        print(i)
        break
    NOW=NOW*101//100

Submission status: Accepted

Solution code:
x = int(input())

s = 100
for i in range(10000):
    s = int(s*1.01)
    if s>=x:
        print(i+1)
        exit()

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
from sys import stdin
from sys import setrecursionlimit
from collections import Counter, deque, defaultdict
from math import floor
from bisect import bisect_left
setrecursionlimit(1000000)

INF = int(1e10)
MOD = int(1e9 + 7)

def input():
    return stdin.readline()[:-1]


def main():
    from builtins import int, map
    X = int(input())
    now = 100

    count = 0
    while now < X:
        count += 1
        now = floor(now * 1.01)

    print(count)


if __name__ == '__main__':
    main()

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

now = 100
cnt = 0
while True:
    now = int(now * 1.01)
    cnt += 1
    if x <= now:
        print(cnt)
        exit()

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1000000)

def solve(X):
    k = 100
    ans = 0
    while k < X:
        k = k + int(k * 0.01)
        ans += 1
    return ans

if __name__ == "__main__":
    X = int(input())
    print(solve(X))

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())
now = 100
ans = 0
while now < X:
    ans += 1
    now = int(now*1.01)
print(ans)

Submission status: Accepted

Solution code:
X=int(input())

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

Submission status: Accepted

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

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

    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

def main():
    X = int(readline())
    ans = 100
    cnt = 0
    while ans < X:
        ans += math.floor(ans * 0.01)
        cnt += 1
    print(cnt)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
now = 100
for i in range(1, 100000):
    now = int(now*1.01)
    if now >= x:
        print(i)
        exit()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7 # 998244353
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    x = int(input())
    now = 100
    cnt = 0
    while now < x:
        now = now * 101 // 100
        cnt += 1
    print(cnt)
resolve()

Submission status: Accepted

Solution code:
FAST_IO = 0
if FAST_IO:
    import io, sys, atexit
    rr = iter(sys.stdin.read().splitlines()).next
    sys.stdout = _OUTPUT_BUFFER = io.BytesIO()
    @atexit.register
    def write():
        sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())
else:
    rr = raw_input
rri = lambda: int(rr())
rrm = lambda: map(int, rr().split())

####

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

print solve(rri())

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

    year = 0
    money = 100

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

    print(year)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

print(ans)

Submission status: Accepted

Solution code:
x=int(input())

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

print(y)

Submission status: Accepted

Solution code:
import sys

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 LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

def main():
    x=II()
    a=100
    for i in range(10**7):
        a=a*101//100
        if a>=x:
            print(i+1)
            break

main()

Submission status: Accepted

Solution code:
def main():
    X = int(input())
    s = 100
    i = 0
    while s < X:
        s += s // 100
        i += 1

    return i

print(main())

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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


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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
 
X=int(input())
def ans165(X:int):
    cash=100#当初の預金額
    count=0
    while True:
        # cash=int(cash*1.01) #元本に１パーセントの利子をつけ小数点以下切り捨て # WA
        # cash = cash * 1.01 * 100 // 100 # 1%の利子をつけて100倍した後に100で割って整数部のみ取り出す # WA
        # cash += cash * 0.01 * 100 // 100 # 1%の利子を計算して100倍した後に100で割って整数部のみ取り出す # WA
        # cash += cash // 100 # 元本に100で割った整数部を足す # AC
        # cash += math.floor(cash * 0.01) # WA
        # cash += math.floor(cash / 100) # WA
        # cash += math.floor(cash // 100) # AC
        cash += int(math.floor(cash / 100)
        count += 1#利子をつける回数だけcountを増やす
        if cash>=X:#cashがXの値以上になったらループ終了
            break
    return count
print(ans165(X))

Submission status: Runtime Error

Solution code:
from math
X=int(input())
def ans165(X:int):
    cash=100#当初の預金額
    count=0
    while True:
        # cash=int(cash*1.01) #元本に１パーセントの利子をつけ小数点以下切り捨て
        # cash += cash // 100 # 元本に100で割った整数部を足す
        cash += math.floor(cash * 0.01)
        count += 1#利子をつける回数だけcountを増やす
        if cash>=X:#cashがXの値以上になったらループ終了
            break
    return count
print(ans165(X))

Submission status: Runtime Error

Solution code:
year = 0 # 答え
money = 100 # 初期値の100円

# x円以上になるまでループを回す
while money < x:
    money *= 1.01
    money = int(money)
    year += 1

print(year)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from math import floor
from decimal import Decimal
def main():
    x = Decimal(input())

    r = 0
    m = Decimal(100)
    while m < x:
        r += 1
        m = Decimal(m * 1.01)
    print(r)

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
X = int(input())
m = 100
count = 0
while i in 32:
  m = math.floor(m * 1.01)
  if m > X:
    count = i + 1
    break
print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
X = int(input())

count = 0
save = 100

while save < X:
  save += a / 100
  save = int(save)
  count += 1
  
print(count)

Submission status: Runtime Error

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

while True:
  yen *= 1.01
  count += 1
  
  if int(year) >= X:
    print(count)
    exit()

Submission status: Runtime Error

Solution code:
x = int(input())

a = 100
i = 0

while a < x:
  i += 1
  a += a // 100
  
  
print(math.floor(i))

Submission status: Runtime Error

Solution code:
x = int(input())

a = 100
i = 0

while a < x:
  i += 1
  a = int(a * 1.01)
  
  
print(math.floor(a))

Submission status: Runtime Error

Solution code:
x = int(input())

a = 100
i = 0

while a < x:
  i += 1
  a = int(a * 1.01)
  
  
print(math.floor(i))

Submission status: Runtime Error

Solution code:
x = int(input())

a = 100
i = 0

while a < x:
  i += 1
  a += 1.01
  
  
print(math.floor(i))

Submission status: Runtime Error

Solution code:
x = int(input())

a = 100
i = 0

while a < x:
  i+ = 1
  a *= 1.01
  
  
print(math.floor(i))

Submission status: Runtime Error

Solution code:
x = int(input())

a = 100
i = 0

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

Submission status: Runtime Error

Solution code:
x = int(input())

a = 100
i = 0

while a < x:
  i+ = 1
  a+ = i
  
  
print(i)

Submission status: Runtime Error

Solution code:
x = int(input())

a = 100
i = 0

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

Submission status: Runtime Error

Solution code:
x = int(input())

a = 100
i = 0

while a < 18:
  print("a="+str(a))
  i+ = a
  a+ = 1

print(x/a)

Submission status: Runtime Error

Solution code:
import math

x = int(input())

mon = 100

for i in range(x):
  mon += mon*0.01
  
print(math.floor(mon))

Submission status: Runtime Error

Solution code:
x=int (input())

i=0

while(x=>100((1+0.01)**i){
  i=i+1
}


print(i)

Submission status: Runtime Error

Solution code:
x=int (input())

i=0

while(x>=100((1+0.01)**i){
  i=i+1
}


print(i)

Submission status: Runtime Error

Solution code:
x=int (input())

i=0

while(x=<100((1+0.01)**i){
  i=i+1
}


print(i)

Submission status: Runtime Error

Solution code:
import math
from decimal import Decimal
X = int(input())
now = Decimal(100)
year = 0

while True:
    if now >= X:
        break
    #王道
    #now += now // 100

    #Decimal型を経由する方法
    #now = int(now * Decimal("1.01"))
    #now = int(now * round(Decimal(1.01), 2))
    now = int(now * round(1.01, 2))
    #now = Decimal(math.floor(now * Decimal(1.01)))
    year += 1

print(year)

Submission status: Runtime Error

Solution code:
import math
from decimal import Decimal
X = int(input())
now = 100
year = 0

while True:
    if now >= X:
        break
    #王道
    #now += now // 100

    #Decimal型を経由する方法
    #now = int(now * Decimal("1.01"))
    #now = int(now * round(Decimal(1.01), 2))
    now = now * Decimal(floor(now * 1.01))


    year += 1

print(year)

Submission status: Runtime Error

Solution code:
import math
from decimal import Decimal
X = int(input())
now = 100
year = 0

while True:
    if now >= X:
        break
    #王道
    #now += now // 100

    #Decimal型を経由する方法
    #now = int(now * Decimal("1.01"))
    #now = int(now * round(Decimal(1.01), 2))
    now = Decimal(floor(now * 1.01))


    year += 1

print(year)

Submission status: Runtime Error

Solution code:
import math
S = int(input())
after = 100
cn = 0

while after < S:
    after = (after * 1.01)
    after = math.floor(after)
    cn += 
    if (after > S):
        break
    
print(cn)

Submission status: Runtime Error

Solution code:
import math
S = int(input())
after = 100
cn = 0

for i in range(10 ** 18):
    after = (after * 1.01)
    after = math.floor(after)
    cn += 
    if (after > S):
        break
    
print(cn)

Submission status: Runtime Error

Solution code:
before = 100
S = int(input())
cn = 0

for i in range(10 ** 18):
    after = (before * 1.01)
    cn += 
    if (after > S):
        break
    
print(cn)

Submission status: Runtime Error

Solution code:
before = 100
S = int(input())

for i in range(10 ** 18):
    after = (before * 1.01)
    cn += 
    if (after < S):
        break
    
print(cn)

Submission status: Runtime Error

Solution code:
from decimal import Decimal

X = int(input())

money = 100
cnt = 0

while money < X:
    money = Decimal(money*1.01)
    cnt += 1
print(cnt)

Submission status: Runtime Error

Solution code:
x=int(input())
for i in range(100,x+1):
  s=s+i//100
print(s)

Submission status: Runtime Error

Solution code:
x=int(input())
for i in range(100,x+1):
  s=s+i
print(s)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
ないかわｋらない
K = int(input())
x = 100
ct = 1
for i in range(K):
    x = x * 101
    x = int(x/100)
    if x >= K:
        print(i+1)
        exit()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import Decimal
import math

def main():
    x = int(input())
    y = 0
    p = Decimal(100)
    while p < x:
        p *= Decimal(1.01)
        p = math.floor(p) 
        y += 1

    print(y)

main()

Submission status: Runtime Error

Solution code:
X = input()
yokin = 100
rishi = 0.01

while true:
  yokin = yokin * rishi
  
  if(int(yokin) => int(X)):
    break