From 6b842c8de61a506ac318321fd05ab5d6ce71e39a Mon Sep 17 00:00:00 2001
From: ShazidMahsrafi <shazid456@gmail.com>
Date: Sun, 24 Dec 2023 19:20:38 +0600
Subject: [PATCH] added 1909A

---
 Codes/1909A Distinct Buttons/1909A.cpp | 97 ++++++++++++++++++++++++++
 Readme.md                              |  1 +
 2 files changed, 98 insertions(+)
 create mode 100644 Codes/1909A Distinct Buttons/1909A.cpp

diff --git a/Codes/1909A Distinct Buttons/1909A.cpp b/Codes/1909A Distinct Buttons/1909A.cpp
new file mode 100644
index 0000000..27969b4
--- /dev/null
+++ b/Codes/1909A Distinct Buttons/1909A.cpp	
@@ -0,0 +1,97 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+// Short forms
+#define int                 long long
+#define ll                  long long
+#define ull                 unsigned long long
+#define endl                '\n'
+#define ff                  first
+#define ss                  second
+#define pb                  push_back
+#define all(x)              x.begin(), x.end()
+#define sz(x)               (int)(x).size()
+
+// Outputs
+#define yes                 cout<<"YES"<<endl
+#define no                  cout<<"NO"<<endl
+
+// Constants
+#define PI                  3.141592653589793238
+#define MIN                 INT_MIN
+#define MAX                 INT_MAX
+#define INF                 LONG_LONG_MAX
+#define M                 1000000007
+#define LLM                 1000000000000000007
+
+// Faster Input Output
+#define FAST_IO             (ios_base:: sync_with_stdio(false),cin.tie(NULL));
+
+// Maths
+ll fact(ll n)                   { if(n==0) return 1; ll res = 1; for (ll i = 2; i <= n; i++) res = res * i; return res; }
+ll nPr(ll n, ll r)              { return fact(n) / fact(n - r); }
+ll nCr(ll n, ll r)              { return fact(n) / (fact(r) * fact(n - r)); }
+ll gcd(ll a, ll b)              { if (b == 0) return a; return gcd(b, a % b); }
+ll lcm(ll a, ll b)              { return (a * b) / gcd(a, b);}
+ull mypow(ull a, ull b)         { ull ans = 1; a%=M; while(b){ if (b&1) ans = (ans*a) % M; a = (a*a) % M; b >>= 1; } return ans; }
+bool isPrime(ll n)              { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true; }
+
+//Debugging
+#ifndef ONLINE_JUDGE
+#define dbg(x) cerr << #x <<" "; _print(x); cerr << endl;
+#define dbgin(x) cerr << #x <<" "; _print(x); cerr << ";"<<endl;
+#else
+#define dbg(x)
+#define dbgin(x)
+#endif
+
+void _print(int t) {cerr << t;}void _print(string t) {cerr << t;}void _print(char t) {cerr << t;}
+void _print(long double t) {cerr << t;}void _print(double t) {cerr << t;}void _print(unsigned ll t) {cerr << t;}
+template <class T, class V> void _print(pair <T, V> p);
+template <class T> void _print(vector <T> v);template <class T> void _print(set <T> v);
+template <class T, class V> void _print(map <T, V> v);template <class T> void _print(multiset <T> v);
+template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.first); cerr << ","; _print(p.second); cerr << "}";}
+template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
+template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
+template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
+template <class T> void _print(unordered_set <T> v) {cerr<<"[ "; for(T i : v) {_print(i); cerr<<" ";} cerr<<"]";}
+template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
+template <class T, class V> void _print(multimap <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";} 
+template <class T, class V> void _print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
+
+/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+
+void solve()
+{
+    int n;
+    cin>>n;
+    set<char>st;
+    int possible = 1;
+    for(int i=0; i<n; ++i)
+    {
+        int p,q;
+        cin>>p>>q;
+        if(p>0)
+            st.insert('r');
+        else if(p<0)
+            st.insert('l');
+        if(q>0)
+            st.insert('u');
+        else if(q<0)
+           st.insert('d');
+        if(st.size()==4)
+            possible = 0;       
+    }
+    if(possible)
+        yes;
+    else
+        no;
+}
+
+int32_t main()
+{
+    FAST_IO;
+    int TC = 1;
+    cin >> TC;
+    while (TC--) solve();
+}
\ No newline at end of file
diff --git a/Readme.md b/Readme.md
index 1652c3a..cb8a4e6 100644
--- a/Readme.md
+++ b/Readme.md
@@ -210,6 +210,7 @@ This repository contains my solutions of Codeforces problems. They are in C++ la
 | 1907A | Rook | [Question](https://codeforces.com/problemset/problem/1907/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1907A%20Rook)
 | 1907B | YetnotherrokenKeoard | [Question](https://codeforces.com/problemset/problem/1907/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1907B%20YetnotherrokenKeoard)
 | 1907C | Removal of Unattractive Pairs | [Question](https://codeforces.com/problemset/problem/1907/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1907C%20Removal%20of%20Unattractive%20Pairs)
+| 1909A | Distinct Buttons | [Question](https://codeforces.com/problemset/problem/1909/A) | [Solution]
 | 1912L | LOL Lovers | [Question](https://codeforces.com/problemset/problem/1912/L) | [Solution]
 | 1913A | Rating Increase | [Question](https://codeforces.com/problemset/problem/1913/A) | [Solution]
 | 1913B | Swap and Delete | [Question](https://codeforces.com/problemset/problem/1913/B) | [Solution]