#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <math.h>
using namespace std;
typedef long long int ll;

int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	ll p,q,a; cin >> p >> q >> a;
	ll left=0,right=1e9+1;
	while(right-left>1){
		ll mid=(left+right)/2;
		if((100+p)*mid/100<(100+q)*mid/100+a){
			left=mid;
		}
		else{
			right=mid;
		}
	}
	ll ans=left-min(left,100LL);
	for(ll i=left-min(left,100LL)+1;i<left-min(left,100LL)+1000;i++){
		if(i>1e9)break;
		if((100+p)*i/100<(100+q)*i/100+a){
			ans++;
		}
	}
	cout << ans << endl;
}