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

int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);

  cin >> inp >> outq >> a;

  if(inp > outq){
    int n = (a+1) * 100 / (inp-outq);
    int cnt = 0;
    // 税率の追い越す差分回ぐらい回す
    FOR(i,1,n+1){
      ll in = (100+inp)*i/100;
      ll out = (100+outq)*i/100 + a;
      if(in < out) cnt++;
    }
    cout << cnt << endl;
  }else if(inp == outq){
    if(a==0) cout << 0 << endl;
    else cout << (ll)1e9 << endl;
  } else {
    if( a > 0 ){
      cout << (ll)1e9 << endl;
      return 0;
    }
    ll n = 100/(inp-outq);
    ll cnt = 1e9;
    FOR(i,1,n+1){
      ll in = (100+inp)*i / 100;
      ll out = (100+outq)*i / 100 + a;
      if(in >= out) cnt--;
    }
    cout << cnt << endl;
  }
  
  return 0;
}