#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll my_pow(ll x, ll n) {
    if (n == 0) return 1;
    if (n % 2 == 0) return my_pow(x * x, n / 2);
    return x * my_pow(x, n - 1);
}

int main() {
    ll P, Q, A;
    cin >> P >> Q >> A;
    if (Q >= P) {
        cout << my_pow(10, 9) << "\n";
        return 0;
    }
    int cnt = 0;
    for (ll x = 1; x <= A * 100; x++) {
        ll p = (100 + P) * x / 100;
        ll q = (100 + Q) * x / 100 + A;
        if (p < q) cnt++;
    }
    cout << cnt << "\n";
    return 0;
}