#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
const int INF = 1e9;
const int MOD = 1000000007;
ll p,q,a ;

ll shop(ll x){
        return floor(((double)(p+100)/100)*(double)(x));
}

ll bring( ll x){
        return floor(((double)(q+100)/100)*(double)(x)) + a;
}

bool ok(ll x){
        return shop(x) < bring(x);
}

int main(){
        cin >> p >> q >> a;
        if(a == 0){
                if(p >= q){
                        cout << 0 << endl;
                        return 0;
                }else{
                        cout << 1000000000 << endl;
                        return 0;
                }
        }
        if(p <= q){
                cout << 1000000000 << endl;
                return 0;
        }

        ll left = 0,right = INF+1;
        while(right - left > 1){
                ll mid = (right+left)/2;
                if(ok(mid)) left = mid ;
                else right = mid;
        }

        int ans = 0;
        for(ll i=1;i<=left;i++){
                if(ok(i)) ans ++;
        }
        cout << ans << endl;
        return 0;
        
}