#pragma region
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define VPII vector<PII>
#define VPLL vector<PLL>
#define ALL(x) (x).begin(), (x).end()
constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
#pragma endregion
//-------------------

int main(){
    cin.tie(0); ios::sync_with_stdio(false); //cout << fixed << setprecision(15);
    ll p,q,a; cin >> p >> q >> a;
    if(p==q) {
        if(a > 0)cout << (int) 1e9 << endl;
        else cout << 0 << endl;
        return 0;
    }
    auto f = [&](ll x, ll p) -> ld{
        return (ld) p * (ld)x / 100.0 + (ld)x;
    };
    if(p<q) {
        ll ans = 1e9;
        for(ll x = 1; x < 1000; x++) {
            ld left = f(x,p);
            ld right = f(x,q) + (ld) a;
            // cout << left << " " << right << endl;
            if( (ll) left >= (ll) right) {
                ans -= 1;
            }
        }
        cout << ans << endl;
        return 0;
    }

    ll ans = 0;
    if(a > 3) {
        ans += (100*a - 200) / (p-q) - 1;
    }
    // cout << ans << endl;
    ll soko = ans+1;
    for(ll x=soko; x < soko+1000; x++) {
        ld left = f(x,p);
        ld right = f(x,q) + (ld) a;
        // cout << left << " " << right << endl;
        if( (ll) left < (ll) right) {
            ans += 1;
        }
    }

    cout << ans << endl;
    return 0;
}