//#define _GLIBCXX_DEBUG
#include "bits/stdc++.h"

using namespace std;

//------------------------------- Libraries --------------------------------//

//------------------------------- Type Names -------------------------------//

using i64 = int_fast64_t;

using seika = string;
//{akari : 1D, yukari : 2D, maki : 3D} vector
template <class kizuna>
using akari = vector<kizuna>;
template <class yuzuki>
using yukari = akari<akari<yuzuki>>;
template <class tsurumaki>
using maki = akari<yukari<tsurumaki>>;
//{akane : ascending order, aoi : decending order} priority queue
template <class kotonoha>
using akane = priority_queue<kotonoha, akari<kotonoha>, greater<kotonoha>>;
template <class kotonoha>
using aoi = priority_queue<kotonoha>;

//------------------------------- Dubug Functions ---------------------------//
inline void print()
{
    cout << endl;
}
template <typename First, typename... Rest>
void print(const First &first, const Rest &... rest)
{
    cout << first << ' ';
    print(rest...);
}
//------------------------------- Solver ------------------------------------//

void solve()
{
    int p, q, a;
    cin >> p >> q >> a;
    if (p <= q)
    {
        cout << int(1e9) << endl;
        return;
    }
    int ans = 0;
    for (i64 i = 0; i < 1e7; i += 4)
    {
        if (((100 + p) * (i + 1) / 100) < ((100 + q) * (i + 1) / 100 + a))
        {
            ans++;
        }
        if (((100 + p) * (i + 2) / 100) < ((100 + q) * (i + 2) / 100 + a))
        {
            ans++;
        }
        if (((100 + p) * (i + 3) / 100) < ((100 + q) * (i + 3) / 100 + a))
        {
            ans++;
        }
        if (((100 + p) * (i + 4) / 100) < ((100 + q) * (i + 4) / 100 + a))
        {
            ans++;
        }
    }
    cout << ans << endl;
}

int main()
{
    solve();
    return 0;
}