#include<algorithm>
#include<cmath>
#include<cstdio>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<string>
#include<utility>
#include<vector>

using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define rep(i,n) for(int i=0;i<n;i++)
#define repl(i,s,e) for(int i=s;i<e;i++)
#define reple(i,s,e) for(int i=s;i<=e;i++)
#define revrep(i,n) for(int i=n-1;i>=0;i--)
#define all(x) (x).begin(),(x).end()

ll P, Q, A;

bool C(ll x)
{
	ll eatin = (100 + P) * x / 100;
	ll takeout = ((100 + Q) * x / 100) + (ll)A;

	//逆の条件
	return eatin < takeout;
}

int main()
{	
	const int MAX_N = 1000000000;

	cin >> P >> Q >> A;

	if (P < Q)
	{
		cout << MAX_N << endl;
		return 0;
	}

	//全探索の範囲を絞る
	ll count = 0;
	reple(i, 1, 1000000)
	{
		if (C(i)) count++;
	}

	cout << count << endl;

	return 0;
}