#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

int P, Q, A;

bool check(int x) {
    return (x + P * x / 100) < (x + Q * x / 100) + A;
}

signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin >> P >> Q >> A;
    
    if (P == Q) {
        if (A == 0) {
            cout << 0 << endl;
        } else {
            cout << 1000000000 << endl;
        }
        return 0;
    }
    int cnt = 0;
    bool lastChecked = false;
    FOR(i, 1, 1e7+1) {
        lastChecked = check(i);
        if (lastChecked) cnt++;
    }
    
    if (lastChecked) {
        cout << cnt + (1000000000 - 10000000) << endl;
    } else {
        cout << cnt << endl;
    }

    return 0;
}