#include"bits/stdc++.h"
using namespace std;
#define REP(k,m,n) for(int (k)=(m);(k)<(n);(k)++)
#define rep(i,n) REP((i),0,(n))
using ll=long long;
using ld=long double;

bool judge(ld P,ld Q,ll A, ll x){
	ll in = floor((1+P/100)*x);
	ll out = floor((1+Q/100)*x)+A;
	//cout<<x<<":"<<in<<"-"<<out<<endl;
	return in<out;
}

ll rjudge(ld P, ld Q, ll A){
	ll safe=0,out=1'000'000'001;
	while(out-safe>1){
		ll mid=(safe+out)/2;
		(judge(P,Q,A,mid)?safe:out)=mid;
	}
	return safe;	
}

int main()
{
	ld P,Q;
	ll A;
	cin>>P>>Q>>A;

	ll res = rjudge(P,Q,A);
	if(res>1e8){
		cout<<res<<endl;
	}else{
		res=0;
		REP(x,1,1e8){
			if(judge(P,Q,A,x))res++;
		}
		cout<<res<<endl;
	}
	return 0;
}