import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

P, Q, A = map(int, read().split())

def F(a, b, U=10**8):
    """count 0 <= n < U such that an + b > 0"""
    if a == 0:
        return U if b > 0 else 0
    if a < 0:
        return U - F(-a, -b+1, U)
    low = ((-b) // a) + 1
    if low < 0:
        low = 0
    return max(0, U - low)

answer = 0
for x in range(1, 101):
    eat_in = (100 + P) * x // 100
    take_out = (100 + Q) * x // 100 + A
    coef = Q - P
    answer += F(coef, take_out - eat_in)

print(answer)