Algorithm

A. A Student's Dream
time limit per test
2 seconds
memory limit per test
256 megabytes
Problem Link- https://codeforces.com/problemset/problem/62/A
input
standard input
output
standard output

Statistics claims that students sleep no more than three hours a day. But even in the world of their dreams, while they are snoring peacefully, the sense of impending doom is still upon them.

A poor student is dreaming that he is sitting the mathematical analysis exam. And he is examined by the most formidable professor of all times, a three times Soviet Union Hero, a Noble Prize laureate in student expulsion, venerable Petr Palych.

The poor student couldn't answer a single question. Thus, instead of a large spacious office he is going to apply for a job to thorium mines. But wait a minute! Petr Palych decided to give the student the last chance! Yes, that is possible only in dreams.

So the professor began: "Once a Venusian girl and a Marsian boy met on the Earth and decided to take a walk holding hands. But the problem is the girl has al fingers on her left hand and ar fingers on the right one. The boy correspondingly has bl and br fingers. They can only feel comfortable when holding hands, when no pair of the girl's fingers will touch each other. That is, they are comfortable when between any two girl's fingers there is a boy's finger. And in addition, no three fingers of the boy should touch each other. Determine if they can hold hands so that the both were comfortable."

The boy any the girl don't care who goes to the left and who goes to the right. The difference is only that if the boy goes to the left of the girl, he will take her left hand with his right one, and if he goes to the right of the girl, then it is vice versa.

Input

The first line contains two positive integers not exceeding 100. They are the number of fingers on the Venusian girl's left and right hand correspondingly. The second line contains two integers not exceeding 100. They are the number of fingers on the Marsian boy's left and right hands correspondingly.

Output

Print YES or NO, that is, the answer to Petr Palych's question.

Examples
input
Copy
5 1
10 5
output
Copy
YES
input
Copy
4 5
3 3
output
Copy
YES
input
Copy
1 2
11 6
output
Copy
NO
Note

The boy and the girl don't really care who goes to the left.



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <cstdio>

int main(){

    int girlLeft(0), girlRight(0); scanf("%d %d", &girlLeft, &girlRight);
    int boyLeft(0), boyRight(0); scanf("%d %d", &boyLeft, &boyRight);

    if((girlLeft - 1 <= boyRight && boyRight <= 2 * (girlLeft + 1)) || (girlRight - 1 <= boyLeft && boyLeft <= 2 * (girlRight + 1)) ){puts("YES");}
    else{puts("NO");}

    return 0;
}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
5 1
10 5

Output

x
–
+
cmd
YES
Advertisements

Demonstration

Codeforces Solution-A. A Student's Dream-Solution in C, C++, Java, Python

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+