Updated

Author: remonhasanapu

A.cpp

@@ -0,0 +1,60 @@
+// author: remonHasan
+#include<bits/stdc++.h>
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+#define ll long long
+#define VI vector < int > v;
+#define PR pair < int, int >
+#define RAB(i, a, b) for (int i = a; i < b; i++)
+#define Brain for(auto &it:v)
+#define PB push_back
+#define IS getline(cin, s);
+#define nl cout << "\n";
+#define ios ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+
+const int MAXN=4e5+5;
+int cnt[MAXN];
+
+
+void solve()
+{
+  int n,m,k; cin>>n>>m>>k;
+  vector<int> a(n), b(m);
+  for(int i=0;i<n;i++) cin>>a[i];
+  for(int i=0;i<m;i++) cin>>b[i];
+
+  
+  vector<int> cnt(k + 1, 0);
+  for (int e : a) {
+      if (e <= k) {
+          cnt[e] |= 1;
+      }
+  }
+
+  for (int e : b) {
+      if (e <= k) {
+          cnt[e] |= 2;
+      }
+  }
+
+  vector<int> c(4, 0);
+  for (int e : cnt) {
+      c[e]++;
+  }
+
+  cout << ((c[1] > k / 2) || (c[2] > k / 2) || (c[1] + c[2] + c[3] != k) ? "NO" : "YES") << endl;
+}
+
+int main() {
+  ios;
+  int t;
+  cin >> t;
+  
+  while (t--) {
+    solve();
+  }
+
+  return 0;
+}

Codeforces (Rating Wise)/1000/1927C-Choose-the-Different-Ones.cpp

@@ -0,0 +1,63 @@
+// author: remonHasan
+#include<bits/stdc++.h>
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+#define ll long long
+#define VI vector < int > v;
+#define PR pair < int, int >
+#define RAB(i, a, b) for (int i = a; i < b; i++)
+#define Brain for(auto &it:v)
+#define PB push_back
+#define IS getline(cin, s);
+#define nl cout << "\n";
+#define ios ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+
+const int MAXN=4e5+5;
+int cnt[MAXN];
+
+ll findGCD(ll a, ll b){
+	while(b != 0){
+		ll tmp = a % b;
+        a = b;
+        b = tmp;
+	}
+
+	return a;
+}
+
+ll findLCM (ll a, ll b){
+	return (a * b)/findGCD(a,b);
+}
+
+void solve()
+{
+  int n; cin >> n;
+  vector<ll> k(n);
+  for(ll i=0;i<n;i++) cin >> k[i];
+
+  ll lcm_result = 1;
+  for(ll i=0;i<n;i++) lcm_result = findLCM(lcm_result,k[i]);
+
+  ll sum = 0;
+  for(ll i=0;i<n;i++) sum += lcm_result / k[i];
+
+  if( sum < lcm_result){
+  	for(ll i=0;i<n;i++) cout << lcm_result / k[i] << " ";
+  	cout << endl;
+  }else{
+  	cout << -1 << endl;
+  }
+}
+
+int main() {
+  ios;
+  int t;
+  cin >> t;
+  while (t--) {
+    solve();
+  }
+
+  return 0;
+}

Codeforces (Rating Wise)/1000/Earning-on-Bets.cpp

@@ -0,0 +1,71 @@
+// author: remonHasan
+#include<bits/stdc++.h>
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+#define ll long long
+#define VI vector < int > v;
+#define PR pair < int, int >
+#define RAB(i, a, b) for (int i = a; i < b; i++)
+#define Brain for(auto &it:v)
+#define PB push_back
+#define IS getline(cin, s);
+#define nl cout << "\n";
+#define ios ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+
+const int MAXN=4e5+5;
+int cnt[MAXN];
+
+
+void solve()
+{
+  string input; 
+  getline(cin, input);
+
+  vector<int> s;
+  for (char c : input) {
+      s.push_back(c - '0');
+  }
+
+  for (int num : s) {
+      cout << num << " ";
+  }
+  cout << endl;
+
+  int zeroes = 0;
+  for (int num : s) {
+      if (num == 0) {
+          zeroes++;
+      }
+  }
+
+  cout << zeroes << endl;
+
+  vector<int> cnt(2, 0);
+  ll ans = 0;
+
+  for (int c : s) {
+      cnt[c]++;
+      if (c == 0) {
+          ans += (cnt[1] > 0) ? 1 : 0;
+      } else {
+          ans += (zeroes - cnt[0]);
+      }
+  }
+
+  cout << ans << endl;
+}
+
+int main() {
+  ios;
+  int t;
+  cin >> t;
+  cin.ignore();
+
+  while (t--) {
+    solve();
+  }
+
+  return 0;
+}

Codeforces (Rating Wise)/1000/Shifts-and-Sorting.cpp

@@ -0,0 +1,39 @@
+#include<bits/stdc++.h>
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+#define ll long long
+#define VI vector < int > v;
+#define PR pair < int, int >
+#define RAB(i, a, b) for (int i = a; i < b; i++)
+#define Brain for(auto &it:v)
+#define PB push_back
+#define IS getline(cin, s);
+#define nl "\n";
+#define ios ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+
+const int MAXN=4e5+5;
+int cnt[MAXN];
+
+
+void solve()
+{
+  int n; cin >> n;
+  string s; cin >> s; 
+  string prevString = s;
+  sort(s.begin(),s.end());
+  cout << (prevString == s ? "YES" : "NO") << nl;
+}
+
+signed main() {
+  ios;
+  int t;
+  cin >> t;
+  
+  while (t--) {
+    solve();
+  }
+
+  return 0;
+}

Codeforces (Rating Wise)/1100/A.cpp

@@ -0,0 +1,38 @@
+#include<bits/stdc++.h>
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+#define ll long long
+#define VI vector < int > v;
+#define PR pair < int, int >
+#define RAB(i, a, b) for (int i = a; i < b; i++)
+#define Brain for(auto &it:v)
+#define PB push_back
+#define IS getline(cin, s);
+#define nl "\n";
+#define ios ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+
+void solve()
+{
+  int n,m; cin >> n >> m;
+  if(m % 2 == 0 && n%2 == 0  && n >= m){
+    cout << "Yes" << nl;
+  }else if(m % 2 != 0 && n%2 != 0  && n >= m){
+    cout << "Yes" << nl;
+  }else{
+    cout << "No" << nl;
+  }
+}
+
+signed main() {
+  ios;
+  int t;
+  cin >> t;
+  
+  while (t--) {
+    solve();
+  }
+
+  return 0;
+}

Codeforces (Rating Wise)/1200/A.cpp

@@ -0,0 +1,40 @@
+/*
+	author: remonhasan
+*/
+
+#include<bits/stdc++.h>
+using namespace std;
+
+#define fl for(int i=0;i<n;i++)
+
+void solve(int n, int x){
+	int arr[n];
+
+    fl cin >> arr[i];
+	
+	int maxi = 0 , j = 0;
+	
+	fl {
+		int A = arr[i] - j;
+		maxi = max(maxi, A);
+		j = arr[i];
+	}
+
+	int B = 2 * (x - arr[n-1]);
+	maxi = max(B, maxi);
+	cout<< maxi << endl;
+ 
+}
+
+int main()
+{
+	ios::sync_with_stdio(0);
+    cin.tie(0);
+    int t;
+    cin >> t;
+    while(t--){
+    	int n,x;
+    	cin >> n >> x;
+    	solve(n,x);
+    }
+}