#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<iostream>
#include<string>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;

int x[100], y[100], z[100];
int main(){
    ll p,q,a;
    cin>>p>>q>>a;
    rep(i,100){
        x[i]=(100+p)*(i+1)/100 - (100+p)*i/100; 
        y[i]=(100+q)*(i+1)/100 - (100+q)*i/100; 
        z[i]=x[i]-y[i];
    }
    int in = -a;
    int idx = 0;
    int ans = 0;
    REP(i,1,1000000001){
        in += z[idx];
        ans += (in<0);
        if(++idx>=100)idx=0;
    }
    cout<<ans<<endl;
    return 0;
}