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 main():
    p,q,a = map(int,input().split())

    if p == q:
        if a == 0:
            print(0)
            return
        else:
            print(1000000000)
            return
    if p < q:
        ans = 1000000000
        for x in range(1,10001):
            if (x * p)//100 >= (x * q)//100 + a:
                ans -= 1
        print(ans)
        return
    
    ans = 0
    for x in range(1,100 * a + 20):
        if (x * p)//100 < (x * q)//100 + a:
            ans +=1           

    print(ans)

if __name__ =='__main__':
    main()