#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;

  if (inf * P <= inf * Q + A) {
    printf("%lld\n", e9);
    return 0;
  }

  // 0 * P 円 < 0 * Q + A円   inf * P円 > inf * Q + A円

  ll l = 0, r = inf / d - 1;

  while (l < r) {
    ll mid = (l + r + 1) / 2;

    if (mid * d * P / 100 < mid * d * Q / 100 + A) {
      l = mid;
    } else {
      r = mid - 1;
    }
  }

  ll ans = l * d - 1;

  debug(ans);

  debug(l * d * P / 100);
  debug(l * d * P / 100);

  for (ll i=l*d; i<(l+1)*d; i++) {
    if (i * P / 100 < i * Q / 100 + A) {
      ans++;
    }
  }

  cout << ans << endl;

  return 0;
}