#include <iostream>

using lint = long long;
constexpr int M = 10000000,
              X = 1000000000;

void solve() {
    lint p, q, a;
    std::cin >> p >> q >> a;

    int ans = 0;

    for (lint m = 1; m <= M; ++m) {
        auto x = m * (p + 100) / 100;
        auto y = m * (q + 100) / 100 + a;
        if (x < y) ++ans;
    }

    std::cout << (ans > M / 2 ? X - (M - ans) : ans) << std::endl;
}

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

    solve();

    return 0;
}