import sys def input(): return sys.stdin.readline().strip() def list2d(a, b, c): return [[c] * b for i in range(a)] def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)] def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)] def ceil(x, y=1): return int(-(-x // y)) def INT(): return int(input()) def MAP(): return map(int, input().split()) def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)] def Yes(): print('Yes') def No(): print('No') def YES(): print('YES') def NO(): print('NO') sys.setrecursionlimit(10 ** 9) INF = 10 ** 19 MOD = 10 ** 9 + 7 EPS = 10 ** -10 def bisearch_max(mn, mx, func): ok = mn ng = mx while ok+1 < ng: mid = (ok+ng) // 2 if func(mid): ok = mid else: ng = mid return ok def check(x): a = (100+p) * x // 100 b = (100+q) * x // 100 + r return a < b p, q, r = MAP() res = bisearch_max(0, 10**9+1, check) lo = max(res-100000, 0) hi = min(res+100000, 10**9+1) cnt = 0 for i in range(lo, hi): if check(i): cnt += 1 ans = lo - 1 + cnt print(ans)