Resources

Author: harshit2608

Codechef/Contests/Airline_Restrictions.cpp

@@ -0,0 +1,40 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll long long int
+
+void fastIO()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(0);
+    cout.tie(0);
+}
+
+int main()
+{
+    fastIO();
+    int t;
+    cin >> t;
+    while (t--)
+    {
+        int a, b, c, d, e;
+        cin >> a >> b >> c >> d >> e;
+        if (a + b <= d && c <= e)
+        {
+            cout << "YES";
+        }
+        else if (b + c <= d && a <= e)
+        {
+            cout << "YES";
+        }
+        else if (c + a <= d && b <= e)
+        {
+            cout << "YES";
+        }
+        else
+        {
+            cout << "NO";
+        }
+        cout << "\n";
+    }
+    return 0;
+}

Codechef/Contests/Shuffling_Parities.cpp

@@ -0,0 +1,38 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll long long int
+
+void fastIO()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(0);
+    cout.tie(0);
+}
+
+int main()
+{
+    fastIO();
+    int t;
+    cin >> t;
+    while (t--)
+    {
+        int n, ele, even = 0, odd = 0;
+        cin >> n;
+        for (int i = 0; i < n; ++i)
+        {
+            cin >> ele;
+            if (ele % 2 == 0)
+            {
+                even++;
+            }
+            else
+            {
+                odd++;
+            }
+        }
+        int even1 = n / 2, odd1 = n / 2 + n % 2;
+        int ans = min(even, odd1) + min(odd, even1);
+        cout << ans << "\n";
+    }
+    return 0;
+}

Codechef/Contests/Travel_Pass.cpp

@@ -0,0 +1,40 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll long long int
+
+void fastIO()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(0);
+    cout.tie(0);
+}
+
+int main()
+{
+    fastIO();
+    int t;
+    cin >> t;
+    while (t--)
+    {
+        int n, a, b;
+        string str;
+        cin >> n >> a >> b;
+        cin >> str;
+        int arr[2] = {0};
+        for (int i = 0; i < n; ++i)
+        {
+            // arr[int(str[i])]++;
+            if (str[i] == '0')
+            {
+                arr[0]++;
+            }
+            else
+            {
+                arr[1]++;
+            }
+        }
+        int ans = (arr[0] * a) + (arr[1] * b);
+        cout << ans << "\n";
+    }
+    return 0;
+}

Codechef/Contests/XOR_Equal.cpp

@@ -0,0 +1,54 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll long long int
+
+void fastIO()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(0);
+    cout.tie(0);
+}
+
+int main()
+{
+    fastIO();
+    int t;
+    cin >> t;
+    while (t--)
+    {
+        int n, a;
+        cin >> n >> a;
+        unordered_map<int, int> mp;
+        vector<int> v;
+
+        for (int i = 0; i < n; ++i)
+        {
+            int ele = 0;
+            cin >> ele;
+            v.push_back(ele);
+            mp[ele]++;
+        }
+
+        int ans = 0, mini = 0;
+        for (auto it : v)
+        {
+            if ((it != it ^ a) && ans < mp[it] + mp[it ^ a])
+            {
+                ans = mp[it] + mp[it ^ a];
+                mini = mp[it ^ a];
+            }
+            else if ((it != it ^ a) && (ans == mp[it] + mp[it ^ a]) && (mini > mp[it ^ a]))
+            {
+                ans = mp[it] + mp[it ^ a];
+                mini = mp[it ^ a];
+            }
+            else if (ans < mp[it])
+            {
+                ans = mp[it];
+                mini = 0;
+            }
+        }
+        cout << ans << " " << mini << "\n";
+    }
+    return 0;
+}