ural 1283. Dwarf

1283. Dwarf

Time limit: 1.0 second
Memory limit: 64 MB

Venus dwarfs are rather unpleasant creatures: ugly, malicious, and mean-spirited. Maybe it’s because of hard living conditions on their planet… but the fact remains: each of them is ready to sell his own mother in order to save up his pot of gold and to preserve it to the end of his days.

The dwarfs are especially nervous about the Mercury leprechauns who are always glad to empty a dwarf’s pot and to fill it with solar dust instead of the gold. The dwarfs are weak-sighted and can’t distinguish dust from gold. That is why each dwarf once a year visits the Central Galaxy Bank (CGB), where experienced specialists authenticate the content of the pot taking a small commission for the job.

When the amount of gold in a pot becomes less than or equal to a certain level, the life of a dwarf has no sense anymore, so he clears the world of his wretched soul: with the remaining gold he buys in a zoo the largest Jupiter toad and creeps under it which results in crushing his chest.

Input

The input contains three integers separated with spaces. The first number is the amount of gold in a dwarf’s pot at the initial moment. The second number is the amount of gold at which the dwarf’s life becomes senseless. Both values are measured in grams and don't exceed 231 − 1. The third number is the CGB commission (from 1 to 100); this is the percentage of gold that is taken from the pot as a way of payment for the verification.

Output

The output should contain the number of years that is left to the dwarf.

Samples

input	output
19 10 50	1
1000 1 1	688

Problem Author: Leonid Volkov (prepared by Ivan Dashkevich)
Problem Source: USU Personal Contest 2004

Tags: none  (hide tags for unsolved problems)

Difficulty: 129

 

题意：输入一个数n，m表示钱的数量和下限（达到下限也会死），一个数k从1到100，表示每年用掉的钱的百分比，然后问多少年死？

分析：暴力

 

 #include <cstdio>
 #include <cstring>
 #include <cstdlib>
 #include <cmath>
 #include <deque>
 #include <vector>
 #include <queue>
 #include <iostream>
 #include <algorithm>
 #include <map>
 #include <set>
 #include <ctime>
 using namespace std;
 typedef long long LL;
 typedef double DB;
 #define For(i, s, t) for(int i = (s); i <= (t); i++)
 #define Ford(i, s, t) for(int i = (s); i >= (t); i--)
 #define Rep(i, t) for(int i = (0); i < (t); i++)
 #define Repn(i, t) for(int i = ((t)-1); i >= (0); i--)
 #define rep(i, x, t) for(int i = (x); i < (t); i++)
 #define MIT (2147483647)
 #define INF (1000000001)
 #define MLL (1000000000000000001LL)
 #define sz(x) ((int) (x).size())
 #define clr(x, y) memset(x, y, sizeof(x))
 #define puf push_front
 #define pub push_back
 #define pof pop_front
 #define pob pop_back
 #define ft first
 #define sd second
 #define mk make_pair
 inline void SetIO(string Name)
 {
     string Input = Name + ".in",
     Output = Name + ".out";
     freopen(Input.c_str(), "r", stdin),
     freopen(Output.c_str(), "w", stdout);
 }

 inline int Getint() {
     int Ret = ;
     char Ch = ' ';
     bool Flag = ;
     while(!(Ch >= '' && Ch <= ''))
     {
         if(Ch == '-') Flag ^= ;
         Ch = getchar();
     }
     while(Ch >= '' && Ch <= '') {
         Ret = Ret *  + Ch - '';
         Ch = getchar();
     }
     return Flag ? -Ret : Ret;
 }

 const DB Eps = 1e-;
 DB a, b, c;
 LL Ans;

 inline void Input() {

 }

 inline void Solve() {
     for(cin >> a >> b >> c; a > b + Eps; a -= a * c / 100.0, Ans++) ;
     cout << Ans << endl;
 }

 int main() {
     #ifndef ONLINE_JUDGE
     SetIO("A");
     #endif
     Input();
     Solve();
     return ;
 }