#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll inf=1000000000000000000;
double pi=2*acos(0);
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
ll lmax(ll a,ll b){
    if(a<b)return b;
    else return a;
}
ll lmin(ll a,ll b){
    if(a<b)return a;
    else return b;
}
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll Pow(ll n,ll k){
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}

int main(){
    ios::sync_with_stdio(false);cin.tie(0);
    ll p,q,a;cin>>p>>q>>a;
    if(p<q){
        if(a>0){
            cout<<1000000000<<endl;
        return 0;
        }
        ll t=1000000000;
        rep(i,1,1000000){
            ll f=i*p;f/=100;
            ll g=i*q;g/=100;
            if(f==g)t--;
        }
        cout<<t<<endl;
        return 0;
    }
    if(a==0){
        cout<<0<<endl;
        return 0;
    }
    if(p==q){
        cout<<1000000000<<endl;
        return 0;
    }
    ll ans=0;
    ll s=-1,t=-1;
    rep(i,1,1000000001){
        ll f=i*p;f/=100;
        ll g=i*q;g/=100;
        if(f-g==a-1&&s==-1){
            s=i;
        }
        if(f-g==a+1){
            t=i;
            break;
        }
    }
    ans=s-1;
    rep(i,s,t){
        ll f=i*p;f/=100;
        ll g=i*q;g/=100;
        if(f-g<a)ans++;
    }
    cout<<ans<<endl;
}