#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please


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


	int P, Q, A;
	cin >> P >> Q >> A;

	if (P <= Q) {
		if (A == 0) {
			if (P == Q) co(0);
			else {
				int kotae = 1000000000;
				rep1(i, 100) {
					int a = (100 + P) * i / 100;
					int b = (100 + Q) * i / 100;
					if (a == b) kotae--;
				}
				co(kotae);
			}
		}
		else co(1000000000);
		return 0;
	}

	int kotae = 0;
	int sa = P - Q;
	int yoyuu = A / sa;
	if (yoyuu > 1) {
		kotae += (yoyuu - 2) * 100;
		A -= (yoyuu - 2) * sa;
	}

	while (A > 0) {
		rep1(i, 100) {
			int a = (100 + P) * i / 100;
			int b = (100 + Q) * i / 100;
			if (a < b + A) kotae++;
		}
		A -= sa;
	}
	co(kotae);

	Would you please return 0;
}