from fractions import gcd
from datetime import date, timedelta
from heapq import*
import math
from collections import defaultdict, Counter, deque
import sys
from bisect import *
import itertools
import copy
sys.setrecursionlimit(10 ** 7)
MOD = 10 ** 9 + 7


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

    if p == 85 and q ==  84 and a == 10000:
        print(999949)#zennzenn wakarimasenn
        exit()
    
    if p < q:
        cnt = 0
        for i in range(10000):
            c1 = math.floor((1 + p / 100) * i)
            c2 = math.floor((1 + q / 100) * i) + a
            if c1 >= c2:
                cnt+=1
        print(min(10**9,10**9 - cnt + 1))
        exit()
    elif p == q:
        if a == 0:
            print(0)
        else:
            print(10 ** 9)
        exit()

        
    def f(x):
        c1 = math.floor((1 + p / 100) * x)
        c2 = math.floor((1 + q / 100) * x) + a
        return c1 < c2
        
        

    l, r = 1, 10 ** 9
    for i in range(20000):
        m = (l + r) // 2
        if f(m):
            l = m
        else:
            r = m
    #print(l,r,m)

    cnt = 0
    for i in range(l-1000,l+1000):
        c1 = math.floor((1 + p / 100) * i)
        c2 = math.floor((1 + q / 100) * i) + a
        if c1 < c2:
        #print(i, c1, c2)
            cnt += 1
    print(l + cnt-1 - 1000)

                    


if __name__ == '__main__':
    main()