#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cstdint>
using namespace std;
typedef long long ll;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define mod 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)

int main(){
    ll p,q,a;
    cin >> p >> q >> a;
    p += 100;
    q += 100;
    // ll ss = 0;
    // for(ll i=1;i<=1000000000;i++){
    //     ll A = p*i/100;
    //     ll B = q*i/100 + a;
    //     if(A<B)ss++;
    // }
    // cerr << ss << endl;
    if(p<=q){
        if(a>0){
            cout << 1000000000 << endl;
            return 0;
        }
        if(p==q){
            cout << 0 << endl;
        }else{
            ll c = 0;
            for(ll i=1;i<=1000;i++){
                ll A = p*i/100;
                ll B = q*i/100 + a;
                if(A<B){
                    c++;
                }
            }
            c += 1000000000-1000;
            cout << c << endl;
        }
    }else{
        ll c = 0;
        for(ll i=1;i<=100000000;i++){
            ll A = p*i/100;
            ll B = q*i/100 + a;
            if(A<B)c++;
        }
        cout << c << endl;
    }
    return 0;
}