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

typedef long long ll;
typedef pair<int,int> P;

#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)

int main() {
    ll p,q,a;
    cin >> p >> q >> a;
    ll ok = 0,ng = 1e9;
    while (ng-ok > 1) {
        ll mid = (ok+ng)/2;
        (p*mid/100 < q*mid/100+a ? ok : ng) = mid;
    }
    ll ans = max(0LL,ok-10000);
    for (ll i = max(1LL,ok-10000+1);i <= min((ll)1e9,ok+10000);++i) if (p*i/100 < q*i/100+a) ans++;
    cout << ans << endl;
}