URAL 1011(枚举)

#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>

using namespace std;
const double EPS = 1e-12;
double  l,r;
bool zero(double t)
{
    return -EPS<t&&t<EPS;
}
bool find(int k)
{
    if((int)(l*k)<(int)(r*k)&&!zero((r*k)-(int)(r*k))) return true;
    return false;
}
int main()
{
    freopen("in.txt","r",stdin);
    while(~scanf("%lf%lf",&l,&r))
    {
        l/=100;r/=100;
        for(int i=1;;i++)
        {
            if(find(i))
            {
                printf("%d\n",i);
                break;
            }
        }
    }
    return 0;
}