#include <bits/stdc++.h>
using namespace std;

#define FOR(i, m, n) for(int (i) = (m); (i) < (n); (i)++)
#define FORN(i, m, n) for(int (i) = (m); (i) <= (n); (i)++)
#define FORR(i, m, n) for(int (i) = (m); (i) >= (n); (i)--)
#define rep(i, n) FOR(i, 0, n)
#define repn(i, n) FORN(i, 1, n)
#define repr(i, n) FORR(i, n, 0)
#define repnr(i, n) FORR(i, n, 1)
#define co(n) cout << (n) << endl
#define cosp(n) cout << (n) << ' '
#define setp(n) cout << fixed << setprecision(n);
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> Vec;

const ll INF = 1e9+1;
const ll LINF = 1e18+1;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const double PI = acos(-1);
const double EPS = 1e-9;

int main(void){
	ll p, q, a;
	cin >> p >> q >> a;

	ll l1 = 0, r1 = 1e9+1;
	while(r1-l1 > 1){
		ll m = (l1+r1)/2;
		ll c1 = m*(100+p)/100;
		ll c2 = m*(100+q)/100+a;
		if(c1 <= c2) l1 = m;
		else r1 = m;
	}
	ll l2 = 0, r2 = 1e9+1;
	while(r2-l2 > 1){
		ll m = (l2+r2)/2;
		ll c1 = m*(100+p)/100;
		ll c2 = m*(100+q)/100+a;
		if(c1 < c2-1) l2 = m;
		else r2 = m;
	}

	ll ans = r1;
	FORN(i, l2, r1){
		ll c1 = i*(100+p)/100;
		ll c2 = i*(100+q)/100+a;
		if(c1 >= c2) ans--;
	}
	co(ans);
	return 0;
}