#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("Yes");}else{puts("No");} #define MAX_N 200005 int main() { ll p,q,a; cin >> p >> q >> a; int ans = 0; if(p <= q && a > 0){ cout << 1000000000 << endl; return 0; } if(p < q){ cout << 1000000000 << endl; return 0; } srep(i,1,10000000){ ll ii = i; if(((ll)100 + p)*ii / (ll)100 < ((ll)100 + q)*ii / (ll)100 + a)ans++; } cout << ans << endl; return 0; }