t=int(input())
for r in range(t):
r,b,d=map(int,input().split())
mi=min(r,b)
mx=max(r,b)
if(mi<=mx<=(1+d)*mi):
print("YES")
else:
print("NO")#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
#define ll long long
int main()
{
ll t;
cin>>t;
while(t--)
{
ll r,b,d;
cin>>r>>b>>d;
if(d==0)
{
if(r!=b)
{
cout<<"NO"<<endl;
continue;
}
}
int a=ceil(((double)max(r,b))/(d+1));
if(a>min(r,b))
cout<<"NO"<<endl;
else
cout<<"YES"<<endl;
}
return 0;
}Duration | Birthday Party |
e-maze-in | Bricks Game |
Char Sum | Two Strings |
Anagrams | Prime Number |
Lexical Sorting Reloaded | 1514A - Perfectly Imperfect Array |
580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |
461. Hamming Distance | 1748. Sum of Unique Elements |
897. Increasing Order Search Tree | 905. Sort Array By Parity |