aboutsummaryrefslogtreecommitdiff
path: root/05-05-2022(Div.3)/A/A.cpp
diff options
context:
space:
mode:
authorOmar Magdy <omar.professional8777@gmail.com>2022-05-06 01:22:57 +0200
committerOmar Magdy <omar.professional8777@gmail.com>2022-05-06 01:22:57 +0200
commit5c3d5f3e83a0113f6fb739ca63389c94232b5adf (patch)
treea01cc81fb5270c8f399be20e2ddcf51f80c28dd4 /05-05-2022(Div.3)/A/A.cpp
parentbda93f87e75bcba7fe881f0333418e78fb9302db (diff)
downloadcompetitive-programming-5c3d5f3e83a0113f6fb739ca63389c94232b5adf.tar.xz
competitive-programming-5c3d5f3e83a0113f6fb739ca63389c94232b5adf.zip
Solved A in div3 05-05-2022
Diffstat (limited to '05-05-2022(Div.3)/A/A.cpp')
-rw-r--r--05-05-2022(Div.3)/A/A.cpp42
1 files changed, 42 insertions, 0 deletions
diff --git a/05-05-2022(Div.3)/A/A.cpp b/05-05-2022(Div.3)/A/A.cpp
new file mode 100644
index 0000000..2f5fb6b
--- /dev/null
+++ b/05-05-2022(Div.3)/A/A.cpp
@@ -0,0 +1,42 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+int main() {
+ int tt,a,b,c,x,y,remX,remY;
+ cin >> tt;
+ while (tt--) {
+ cin >> a >> b >> c >> x >> y;
+ if(a > x && b < y) {
+ remX = 0;
+ remY = y - b;
+ }
+ else if (a < x && b > y) {
+ remX = x - a;
+ remY = 0;
+ }
+ else if (a > x && b > y) {
+ remX =0;
+ remY =0;
+ }
+ else {
+ remX = x - a;
+ remY = y - b;
+ }
+ if(c == 0) {
+ if(a >= x && b >= y) {
+ cout << "YES" << endl;
+ }
+ else {
+ cout << "NO" << endl;
+ }
+ }
+ else if(c >= remX + remY) {
+ cout << "YES" << endl;
+ }
+ else {
+ cout << "NO" << endl;
+ }
+
+ }
+}