#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
    /*
     x(1 + P/100) < x(1 + Q/100) + A
     x(P - Q) < 100 * A
     x < 100 * A / (P - Q)
     
     
     P Q A
     20 0 10
     10 8 30
     */
    
    cin >> P >> Q >> A;
    
    if (P == Q) {
        cout << 0 << endl;
        return 0;
    }
    int x = 100 * A / (P - Q);
    int upside = x;
    int upcnt = 0;
    REP(i, 1e8) {
        if (upside >= 1e9) break;
        upside++;
        if (check(++upside)) upcnt++;
    }
    int dwcnt = 0;
    int dwside = x;
    REP(i, 1e8) {
        if (dwside <= 1) break;
        dwside--;
        if (check(++dwside)) dwcnt++;
    }
    
    int ngCount = (upside - x - upcnt) + (x - dwside - dwcnt) + !check(x);
    
    cout << (upside - ngCount) << endl;

    return 0;
}