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

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

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

    cnt = 0
    for i in range(100000):
        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(cnt-1)

                    


if __name__ == '__main__':
    main()