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

double P, Q;
long long A;
long long search(int flag)
{
    long long left = 0;
    long long right = 1e9+1;
    while(right - left > 1)
    {
        long long mid = (left+right)/2;
        long long p = (long long)((double)mid * ((double)1.0 + P/(double)100));
        long long q = (long long)((double)mid * ((double)1.0 + Q/(double)100)) + A;
        if(flag == 1)
        {
            if(p > q) right = mid;
            else left = mid;
        }
        else if(flag == 2)
        {
            if(p >= q-1) right = mid;
            else left = mid;
        }
    }
    return right;
}

int main()
{
    cin >> P >> Q >> A;
    long long top = search(1);
    long long bot = search(2);
    long long cnt = 0;
    for(long long i = bot+1; i <= top; i++)
    {
        long long p = (long long)((double)i*((double)1.0+P/(double)100));
        long long q = (long long)((double)i*((double)1.0+Q/(double)100))+A;
        if(p < q) cnt++;
    }

    long long ans = bot+cnt;
    cout << ans << endl;
    return 0;
}