MOD = 10 ** 9 + 7
INF = 10 ** 10
import sys
input = sys.stdin.readline
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)
from bisect import bisect_left,bisect_right
from collections import deque

def ok(x,p,q,a):
    return (x + (x * p)//100) < (x + (x * q)//100) + a

def main():
    p,q,a = map(int,input().split())

    l = -1
    r = 10 ** 9 + 1
    while r - l > 1:
        mid = (r + l)//2
        if ok(mid,p,q,a):
            l = mid
        else:
            r = mid
    
    ans = max(l - 1000,0)
    for i in range(max(l - 999,1),min(l + 1000,1000000001)):
        if ok(i,p,q,a):
            ans += 1
    print(ans)

if __name__ =='__main__':
    main()