ural 1283. Dwarf

 1 #include <cstdio>
 2 #include <cstring>
 3 #include <cstdlib>
 4 #include <cmath>
 5 #include <deque>
 6 #include <vector>
 7 #include <queue>
 8 #include <iostream>
 9 #include <algorithm>
10 #include <map>
11 #include <set>
12 #include <ctime>
13 using namespace std;
14 typedef long long LL;
15 typedef double DB;
16 #define For(i, s, t) for(int i = (s); i <= (t); i++)
17 #define Ford(i, s, t) for(int i = (s); i >= (t); i--)
18 #define Rep(i, t) for(int i = (0); i < (t); i++)
19 #define Repn(i, t) for(int i = ((t)-1); i >= (0); i--)
20 #define rep(i, x, t) for(int i = (x); i < (t); i++)
21 #define MIT (2147483647)
22 #define INF (1000000001)
23 #define MLL (1000000000000000001LL)
24 #define sz(x) ((int) (x).size())
25 #define clr(x, y) memset(x, y, sizeof(x))
26 #define puf push_front
27 #define pub push_back
28 #define pof pop_front
29 #define pob pop_back
30 #define ft first
31 #define sd second
32 #define mk make_pair
33 inline void SetIO(string Name)
34 {
35     string Input = Name + ".in",
36     Output = Name + ".out";
37     freopen(Input.c_str(), "r", stdin),
38     freopen(Output.c_str(), "w", stdout);
39 }
40 
41 inline int Getint() {
42     int Ret = 0;
43     char Ch = ‘ ‘;
44     bool Flag = 0;
45     while(!(Ch >= ‘0‘ && Ch <= ‘9‘))
46     {
47         if(Ch == ‘-‘) Flag ^= 1;
48         Ch = getchar();
49     }
50     while(Ch >= ‘0‘ && Ch <= ‘9‘) {
51         Ret = Ret * 10 + Ch - ‘0‘;
52         Ch = getchar();
53     }
54     return Flag ? -Ret : Ret;
55 }
56 
57 const DB Eps = 1e-6;
58 DB a, b, c;
59 LL Ans;
60 
61 inline void Input() {
62     
63 }
64 
65 inline void Solve() {
66     for(cin >> a >> b >> c; a > b + Eps; a -= a * c / 100.0, Ans++) ;
67     cout << Ans << endl;
68 }
69 
70 int main() {
71     #ifndef ONLINE_JUDGE 
72     SetIO("A");
73     #endif 
74     Input();
75     Solve();
76     return 0;
77 }