#include <bits/stdc++.h>
#include <random>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vvvvll = vector<vvvll>;
using vvvvvll = vector<vvvvll>;
using vvvvvvll = vector<vvvvvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vvvvb = vector<vvvb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;
using vvvvd = vector<vvvd>;
using vvvvvd = vector<vvvvd>;
#define all(A) A.begin(),A.end()
#define ALL(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
using pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;

template<class T>
bool chmax(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

template<class T>
bool chmin(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

ll gcd(ll(a), ll(b)) {
    if (b == 0)return a;
    ll c = a;
    while (a % b != 0) {
        c = a % b;
        a = b;
        b = c;
    }
    return b;
}

ll mod = 998244353;
ll modPow(long long a, long long n, long long p = mod) {
    if (n == 0) return 1; // 0乗にも対応する場合
    if (n == 1) return a % p;
    if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
    long long t = modPow(a, n / 2, p);
    return (t * t) % p;
}






int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll P,Q,A;
    cin>>P>>Q>>A;
    ll an=0;
    
    if(P<Q&&A>0){
        cout<<ll(1e9)<<endl;
        return 0;
    }
    if(P==Q){
        if(A==0){
            cout<<0<<endl;
            return 0;
        }
        if(A>0){
            cout<<ll(1e9)<<endl;
            return 0;
        }
    }
    for(ll x=1;x<=1e8;x++){
        ll p=(100+P)*x;
        ll q=(100+Q)*x;
        p/=100;
        q/=100;
        q+=A;
        if(p>=q)an++;
    }
    ll x=1000000000;
    if(((100+P)*x)/100<((100+Q)*x)/100+A){
        //an=1000000000-(100000000-an);
        //cout<<1000000000-(100000000-an)<<endl;
        //cout<<2<<endl;
    }
    else {
        //cout<<an<<endl;
        an+=900000000;
    }
    cout<<1000000000-(an)<<endl;
}