D. Wooden Fence
time limit per test
1.0 s
memory limit per test
256 MB
input
standard input
output
standard output
Asem has a wooden fence consisting of n boards, in which n is an odd number. Asem wants to paint this fence using two colors; black and white, such that the first board will be painted black, the second board will be painted white, the third board will be painted black, and so on.
Asem has black paint that can paint at most x boards and white paint that can paint at most y boards. Your task is to determine if you can paint the whole fence or not. Can you?
Input
The first line contains an integer T (1 ≤ T ≤ 104) specifying the number of test cases.
Each test case consists of a line containing three integers n, x, y (1 ≤ n, x, y < 109), in which n is an odd number specifying the number of boards in the fence, x is the maximum number of boards that can be painted in black, and y is the maximum number of boards that can be painted in white.
Output
For each test case, print a single line containing "YES" (without quotes) if you can paint the whole fence. Otherwise, print "NO" (without quotes).
Example
input
Copy
3 5 3 3 7 2 3 9 6 2
output
Copy
YES NO NO
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n,a,b;
scanf("%d%d%d",&n,&a,&b);
int ans=n/2;
if(a>=ans+1&&b>=ans)
printf("YES\n");
else printf("NO\n");
}
return 0;
}