// need #include #include // data structure #include #include #include #include #include #include #include #include #include //#include #include #include #include #include // etc #include #include #include #include #include #include #include #include // input #define INIT std::ios::sync_with_stdio(false);std::cin.tie(0); #define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__); template void MACRO_VAR_Scan(T& t) { std::cin >> t; } templatevoid MACRO_VAR_Scan(First& first, Rest& ...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); } #define VEC_ROW(type, n, ...)std::vector __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_ void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); } templatevoid MACRO_VEC_ROW_Init(int n, First& first, Rest& ...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); } template void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; } templatevoid MACRO_VEC_ROW_Scan(int p, First& first, Rest& ...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); } #define VEC(type, c, n) std::vector c(n);for(auto& i:c)std::cin>>i; #define MAT(type, c, m, n) std::vector> c(m, std::vector(n));for(auto& R:c)for(auto& w:R)std::cin>>w; // output templatevoid MACRO_OUT(const T t) { std::cout << t; } templatevoid MACRO_OUT(const First first, const Rest...rest) { std::cout << first << " "; MACRO_OUT(rest...); } #define OUT(...) MACRO_OUT(__VA_ARGS__); #define FOUT(n, dist) std::cout<=(a);--w) #define REP(w, n) for(int w=0;w=0;--w) #define IN(a, x, b) (a<=x && x inline T CHMAX(T & a, const T b) { return a = (a < b) ? b : a; } template inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; } // test template using V = std::vector; template using VV = V>; template std::ostream& operator<<(std::ostream& os, std::pair p) { os << "(" << p.first << ", " << p.second << ")"; return os; } // type/const #define int ll using ll = long long; using ull = unsigned long long; using ld = long double; using PAIR = std::pair; using PAIRLL = std::pair; constexpr int INFINT = (1 << 30) - 1; // 1.07x10^ 9 constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9 constexpr ll INFLL = 1LL << 60; // 1.15x10^18 constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18 constexpr double EPS = 1e-10; constexpr int MOD = 998244353; constexpr double PI = 3.141592653589793238462643383279; template void FILL(T(&a)[N], const T & val) { for (auto& x : a) x = val; } template void FILL(ARY(&a)[N][M], const T & val) { for (auto& b : a) FILL(b, val); } template void FILL(std::vector & a, const T & val) { for (auto& x : a) x = val; } template void FILL(std::vector> & a, const T & val) { for (auto& b : a) FILL(b, val); } // ------------>8------------------------------------->8------------ signed main() { INIT; VAR(int, p, q, a); auto check = [&](int x) { return (x + x * p / 100) < (x + x * q / 100) + a; }; if (p < q) { int ans = 1000000000; FOR(i, 1, 100000000) { if (!check(i)) --ans; } OUT(ans)BR; return 0; } if (p == q) { if (a == 0) { OUT(0)BR; } else { OUT(1000000000)BR; } return 0; } // p > q ll ok = 1, ng = 1000000000; while (ng - ok > 1) { int me = (ok + ng) / 2; if (check(me)) ok = me; else ng = me; } int low = std::max(1ll, ok - 50000000); int high = std::min(1000000000ll, ng + 50000000); int ans = low - 1; FOR(i, low, high + 1) { if (check(i)) ++ans; } OUT(ans)BR; return 0; }