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.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
dij = [(0, 1), (1, 0), (1, 1), (1, -1)]
inf = 10**19
# md = 998244353
md = 10**9+7

p,q,a=LI()

if p==q:
    if a==0:print(0)
    else:print(10**9)
    exit()

if p<q:
    ans=10**9-1000004
    for x in range(1,1000005):
        s = (100+p)*x//100
        h = (100+q)*x//100+a
        if s < h: ans += 1
    print(ans)
else:
    l=max(1,100*a//(p-q)-1000000)
    r=min(10**9+1,l+2000000)
    ans=l-1
   
    for x in range(l,r):
        s=(100+p)*x//100
        h=(100+q)*x//100+a
        if s<h:ans+=1
    
    print(ans)