1608.cpp

2^x mod n = 1 acm竞赛题 Give a number n, find the minimum x that satisfies 2^x mod n = 1. Input

//1608.cpp

#include<iostream>
using namespace std;
int main()
{
    float a,b,r1,r2,c,r3;
    while(cin>>a>>b>>r1>>r2)
    {
        c=a;
        if(c>b)c=b;
        r3=2*r1;
        if(r3<(2*r2))r3=2*r2;
        if(r3<c-0.01)cout<<"Yes"<<endl;
        else cout<<"No"<<endl;
    }
}