#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <complex>
#include <string>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <bitset>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#ifndef LOCAL
#define debug(x) ;
#else
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;

template <typename T1, typename T2>
ostream &operator<<(ostream &out, const pair<T1, T2> &p) {
  out << "{" << p.first << ", " << p.second << "}";
  return out;
}

template <typename T>
ostream &operator<<(ostream &out, const vector<T> &v) {
  out << '{';
  for (const T &item : v) out << item << ", ";
  out << "\b\b}";
  return out;
}
#endif

#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 200010

// GCC __gcd(long long A, long long B)

ll gcd(ll a, ll b){
  if(a == 0) return b;
  return gcd(b%a, a);
}

ll lcm(ll a, ll b){
  return a / gcd(a, b) * b;
}

const ll e9 = 1000000000;

int main(){
  int P, Q, A;

  cin >> P >> Q >> A;

  int d = P * Q == 0 ? 1 : lcm(P, Q);
  d = lcm(d, 100);

  ll inf = (e9 + d - 1) / d * d;

  ll ans = 0;

  for (int i=1; i<=d; i++) {
    int L = 0, R = (e9 - i) / d;

    int bp = i * P / 100;
    int bq = i * Q / 100 + A;
    int p = d * P / 100; //店内
    int q = d * Q / 100; //持ち帰り

    // bp + p * x < bq + q * x

    if (P == Q) {
      if (bp < bq) ans += R + 1;
    } else {
      if (P < Q && bp <= bq) {
        ans += R + 1 - (bp == bq);
      } else if (P > Q && bp >= bq) {
        ans += 0;
      } else if (P < Q) {
        // bp > bq
        int l = L, r = R;
        while(l < r) {
          int mid = (l + r) / 2;
          if (bp + p * mid >= bq + q * mid) {
            l = mid + 1;
          } else {
            r = mid;
          }
        }
        ans += R - l + 1;
      } else {
        // P > Q, bp < bq
        int l = L, r = R;
        while(l < r) {
          int mid = (l + r + 1) / 2;
          if (bp + p * mid < bq + q * mid) {
            l = mid;
          } else {
            r = mid - 1;
          }
        }
        debug(p);
        debug(l);
        ans += l + 1;
      }
    }
    debug(i);
    debug(ans);
  }

  cout << ans << endl;

  return 0;
}