import sys; input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
con = 10 ** 9 + 7; INF = float("inf")

def getlist():
	return list(map(int, input().split()))

def func(P, Q, A, x):
	val = int((100 * x + P * x) // 100) - int((100 * x + Q * x) // 100) - A 
	return val

def Binary_Search(P, Q, A):
	#初期化
	left = 1
	right = 10 ** 9
	ans = None
	
	#二分探索
	while left <= right:
		x = (left + right) // 2
		if func(P, Q, A, x) >= 0:
			right = x - 1
		else:
			ans = x
			left = x + 1

	return ans

#処理内容
def main():
	P, Q, A = getlist()
	ans = Binary_Search(P, Q, A)
	for i in range(max(1, ans - 100000), ans):
		if func(P, Q, A, i) >= 0:
			ans -= 1

	# for i in range(ans + 1, ans + 100000):
	# 	if func(P, Q, A, i) < 0:
	# 		ans += 1

	print(ans)

if __name__ == '__main__':
	main()