#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
#include <complex>
#include <cctype>
#include <bitset>
using namespace std;
typedef string::const_iterator State;
#define Ma_PI 3.141592653589793
#define eps 1e-5
#define LONG_INF 2000000000000000000LL
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL
#define MOD 998244353LL
#define seg_size 262144
#define REP(a,b) for(long long a = 0;a < b;++a)
int main() {
#define int long long
	int p, q, a;
	cin >> p >> q >> a;
	if (p < q) {
		long long ans = 1000000000;
		for (long long i = 1; i <= 10000000; ++i) {
			long long calc_ten = (100LL + p) * i;
			calc_ten /= 100LL;
			long long calc_ie = (100LL + q) * i;
			calc_ie /= 100LL;
			calc_ie += a;
			if (calc_ten >= calc_ie) {
				ans--;
			}
		}
		cout << ans << endl;
		return 0;
	}
	else if (p == q) {
		cout << 0 << endl;
		return 0;
	}
	long long bot = 0;
	long long top = 1000000000+1;
	while (llabs(bot - top) > 1) {
		long long mid = (top + bot) / 2LL;
		long long calc_ten = (100LL + p) * mid;
		calc_ten /= 100LL;
		long long calc_ie = (100LL + q) * mid;
		calc_ie /= 100LL;
		calc_ie += a;
		if (calc_ten < calc_ie) {
			bot = mid;
		}
		else {
			top = mid;
		}
	}
	long long ans = bot;
	for (long long i = bot; i >= 1&&i >= bot - 10000000LL; --i) {
		long long calc_ten = (100LL + p) * i;
		calc_ten /= 100LL;
		long long calc_ie = (100LL + q) * i;
		calc_ie /= 100LL;
		calc_ie += a;
		if (calc_ten >= calc_ie) {
			ans--;
		}
	}
	cout << ans << endl;
}