#!/usr/bin/python

from collections import deque
from collections import Counter

def ir():
    return int(raw_input())

def ia():
    line = raw_input()
    line = line.split()
    return map(int, line)

n, x, y = ia()

def solve():
    lo, hi = 0, 100000000
    for i in range(100):
        mi = (lo + hi) // 2
        if   (x + mi) * 100  >  y * n: hi = mi
        elif (x + mi) * 100  == y * n: print mi; return
        else                      : lo = mi + 1

    print mi

solve()
