import std.stdio, std.conv, std.functional, std.string; import std.algorithm, std.array, std.container, std.range, std.typecons; import std.numeric, std.math, std.random; import core.bitop; string FMT_F = "%.10f"; static File _f; void file_io(string fn) { _f = File(fn, "r"); } static string[] s_rd; T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; } T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; } T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; } T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; } T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; } T[] RDA(T = long)(T fix = 0) { if (_f.isOpen) return _RDA!T(_f, fix); else return _RDA!T(fix); } size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;} size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; } bool inside(T)(T x, T b, T e) { return x >= b && x < e; } long lcm(long x, long y) { return x * (y / gcd(x, y)); } long mod = 10^^9 + 7; //long mod = 998244353; //long mod = 1_000_003; void moda(ref long x, long y) { x = (x + y) % mod; } void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; } void modm(ref long x, long y) { x = (x * y) % mod; } void main() { auto P = RD; auto Q = RD; auto A = RD; bool f(long x) { auto cost1 = x * ((100+P)/100.0); auto cost2 = x * ((100+Q)/100.0) + A; debug writeln(x, ":", cost1, " < ", cost2); return cost1 < cost2; } long ok, ng; ok = 0; ng = (10^^9)+1; while (abs(ok-ng) > 1) { auto mid = (ok+ng) / 2; if (f(mid)) ok = mid; else ng = mid; } auto ans = ok; foreach (i; max(10000000, ok-10000000)..max(10000000, ok+1)) { auto cost1 = i * ((100+P)/100.0); auto cost2 = i * ((100+Q)/100.0) + A; if (cast(long)cost1 >= cast(long)cost2) --ans; } foreach (i; 1..min(10000001, ok+1)) { auto cost1 = i * ((100+P)/100.0); auto cost2 = i * ((100+Q)/100.0) + A; if (cast(long)cost1 >= cast(long)cost2) --ans; } writeln(ans); stdout.flush(); debug readln(); }