#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <limits>
#include <iomanip>
using namespace std;

using ll=long long;
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i=k; i<(ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
#define ALL(v) v.begin(),v.end()
template<class T> inline bool chmax(T& a, T b) {if (a<b) {a=b; return true;} return false;}
template<class T> inline bool chmin(T& a, T b) {if (a>b) {a=b; return true;} return false;}
#define DEBUG_VLL(vec) REP(sz, vec.size()) cerr<<vec[sz]<<(sz==vec.size()-1?'\n':' ');

const ll MOD = 1000000007;
const ll HIGHINF = (ll)1e18;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll p, q, a; cin >> p >> q >> a;
    ll low = 1, high = HIGHINF / 2 + 1;
    // low: 店内, high: 持ち帰り
    while (low < high) {
        ll mid = (low + high) / 2;
        if (mid + p * mid / 100 < mid + q * mid / 100 + a) low = mid + 1;
        else high = mid;
    }
    ll ans = low;

    for (ll i = max(low - 5000000, 0LL); i <= low + 5000000; i++) {
        if (i <= low && i + p * i / 100 >= i + q * i / 100 + a) ans--;
        else if (i > low && i + p * i / 100 < i + q * i / 100 + a) ans++;
    }
    cout << ans << '\n';
    return 0;
}