#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=100005,INF=1<<30;

int main(){
    
    ll P,Q,A;cin>>P>>Q>>A;
    if(P<=Q){
        ll ans=0;
        for(ll i=1;i<=100000000;i++){
            if((100+P)*i/100<(100+Q)*i/100+A) ans++;
        }
        cout<<ans<<endl;
    }else if(1*(100+P)/100>=1*(100+Q)/100+A){
        cout<<0<<endl;
    }else if((100+P)*1000000000/100<(100+Q)*1000000000/100+A){
        
        ll ans=900000000;
        for(ll i=900000001;i<=1000000000;i++){
            if((100+P)*i/100<(100+Q)*i/100+A) ans++;
        }
        cout<<ans<<endl;
    }else{
        ll left=1,right=1000000000;
        while(right-left>1){
            ll mid=(left+right)/2;
            if((100+P)*mid/100<(100+Q)*mid/100+A) left=mid;
            else right=mid;
        }
        //cout<<left<<endl;
        ll ans=max(0LL,left-100000000-1);
        
        for(ll i=max(1LL,left-100000000);i<=min(1000000000LL,left+100000000);i++){
            if((100+P)*i/100<(100+Q)*i/100+A) ans++;
        }
        
        cout<<ans<<endl;
    }
}