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

int main() {
  int p, q, a;
  cin >> p >> q >> a;
  if (p <= q) {
    cout << (int)1e9 << '\n';
    return 0;
  }
  auto chk = [&](long long x) -> bool {
    return x * (100 + p) / 100 < x * (100 + q) / 100 + a;
  };
  int ok = 0, ng = 1e9 + 1;
  while (ng - ok > 1) {
    int mid = (ok + ng) / 2;
    (chk(mid) ? ok : ng) = mid;
  }
  const int w = 1e6;
  int l = max(ok - w, 1), u = min<int>(ok + w, 1e9);
  int res = (l - 1);
  for (int x = l; x <= u; ++x) {
    res += chk(x);
  }
  cout << res << '\n';
}