/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author aajisaka
 */


#include<bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SPEED ios_base::sync_with_stdio(false);cin.tie(nullptr)
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#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; }

using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;

constexpr long double PI = 3.14159265358979323846264338327950288L;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

class No928 {
public:
    void solve(istream& cin, ostream& cout) {
      SPEED;
      int p, q, a; cin >> p >> q >> a;
      if (p == q) {
        if (a > 0) {
          cout << (int)(1e+9) << endl;
        } else {
          cout << 0 << endl;
        }
        return;
      }

      ll ret = 0;

      for(int s=1; s<=100; s++) {
        int qs = q*s/100;
        int ps = p*s/100;
        if (p > q) {
          int k = qs-ps+a;
          if (k <= 0) continue;
          if (k%(p-q)==0) {
            ret += min(k/(p-q),(int)1e+7);
          } else {
            ret += min(k/(p-q)+1,(int)1e+7);
          }
        } else {
          int k = ps-qs-a;
          if (k < 0) {
            ret += 1e+7;
            continue;
          }
          ret += max(0, (int)(1e+7)-(k/(q-p)+1));
        }
      }

      cout << ret << endl;
    }
};

signed main() {
  No928 solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  solver.solve(in, out);
  return 0;
}