#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;

int main(){
    ll p,q,a;
    cin>>p>>q>>a;
    ll ok = 0, ng = 1e9+1;
    while(ng-ok>1){
        ll mid = (ok+ng)/2;
        ll in = (100+p)*mid/100;
        ll out = (100+q)*mid/100+a;
        if(in<out)ok=mid;
        else ng = mid;
    }
    ok -= 100000;
    ok=max(0ll,ok);
    int ans = ok;
    REP(i,1,200000){
        ll in = (100+p)*(ok+i)/100;
        ll out = (100+q)*(ok+i)/100+a;
        if(in<out)++ans;
    }
    cout<<ans<<endl;
    return 0;
}