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

//repetition
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)

//container util
#define all(x) (x).begin(),(x).end()

//typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;

//const value
//const ll MOD = 1e9 + 7;
//const int dx[] = {0,1,0,-1};//{0,0,1,1,1,-1,-1,-1};
//const int dy[] = {1,0,-1,0};//{1,-1,0,1,-1,0,1,-1};

//conversion
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
inline ll toLL(string s) {ll v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
double inp,outq;
ll a;

bool check(double mid){
    ll out = a+ (ll)((1. + outq/100.) * mid);
    ll in = (ll)((1.+ inp/100.) * mid);
    return in < out;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> inp >> outq >> a;
  if(inp > outq){
    ll ok = 0; // in ga ok
    ll ng = 1e9+1; // in ga ng
    while(abs(ok - ng ) > 1){
      ll mid = (ok + ng) / 2;
      if(check(mid)) ok = mid;
      else ng = mid; 
    }
    ll ans = max<ll>(ok-500,0);
    FOR(i,ok-499, ok + 500){
        if(i < 1) continue;
        if(check(i)) ans++;
    }
    cout << ans << endl;
  }else if(inp == outq){
    if(a > 0) cout << (ll)1e9 << endl;
    else cout << 0 << endl;
  }else{
    cout << (ll) 1e9 << endl;
  }
  
  return 0;
}