#include <bits/stdc++.h>

using namespace std;

using ll = long long;

// (100 + q) * x + 100 * a + 1 > (100 + p) * x
// (q - p) * x > -100 * a + 1
// x > (100-100 * a) / (q - p) [q > p]
// x < (100 * a - 100) / (p - q) [q < p]

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll p, q, a;
    cin >> p >> q >> a;
    if (p == q) {
        cout << (a == 0 ? 0 : 1000000000) << "\n";
        return 0;
    }

    if (q > p) {
        ll ng = 0, ok = 1e9 + 1;
        while (ok - ng > 1) {
            ll mid = (ok + ng) / 2;
            ll v1 = (100 + p) * mid / 100;
            ll v2 = (100 + q) * mid / 100 + a;
            (v2 > v1 ? ok : ng) = mid;
        }
        ll x = min(x + 200000, 1000000000LL);
        ll ans = 1000000000LL - x + 1;
        for (ll i = x - 1; i >= max(x - 400000, 0LL); i--) {
            ll v1 = (100 + p) * i / 100;
            ll v2 = (100 + q) * i / 100 + a;  
            ans += (v2 > v1);
        }
        cout << ans << endl;
        return 0;
    }

    ll ok = 0, ng = 1e9 + 1;
    while (ng - ok > 1) {
        ll mid = (ok + ng) / 2;
        ll v1 = (100 + p) * mid / 100;
        ll v2 = (100 + q) * mid / 100 + a;
        (v2 > v1 ? ok : ng) = mid;
    }
    ll x = max(x - 200000, 0LL);
    ll ans = x;
    for (ll i = x + 1; i <= min(x + 400000, 1000000000LL); i++) {
        ll v1 = (100 + p) * i / 100;
        ll v2 = (100 + q) * i / 100 + a;  
        ans += (v2 > v1);      
    }
    cout << ans << endl;
    return 0;
}