Add files via upload

Author: MathProgrammer

2022/Contests/Combined Divisions/CodeTON/Programs/Good Pairs.cpp

@@ -0,0 +1,42 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+void solve()
+{
+    int no_of_elements;
+    cin >> no_of_elements;
+
+    vector <int> A(no_of_elements + 1);
+    for(int i = 1; i <= no_of_elements; i++)
+    {
+        cin >> A[i];
+    }
+
+    int minimum = 1, maximum = 1;
+    for(int i = 1; i <= no_of_elements; i++)
+    {
+        if(A[i] >= A[maximum])
+        {
+            maximum = i;
+        }
+        else if(A[i] < A[minimum])
+        {
+            minimum = i;
+        }
+    }
+
+    cout << minimum << " " << maximum << "\n";
+}
+
+int main()
+{
+    int no_of_test_cases;
+    cin >> no_of_test_cases;
+
+    while(no_of_test_cases--)
+        solve();
+
+    return 0;
+}

2022/Contests/Combined Divisions/CodeTON/Programs/K-good.cpp

@@ -0,0 +1,60 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+long long get_odd_part(long long n)
+{
+    while(n%2 == 0)
+    {
+        n = n >> 1;
+    }
+
+    return n;
+}
+
+void solve()
+{
+    long long n;
+    cin >> n;
+
+    if(n%2 == 1)
+    {
+        cout << "2\n";
+        return;
+    }
+
+    long long original_n = n;
+    long long odd_part = 1, even_part = 1;
+    while(n%2 != 1)
+    {
+        n = n >> 1;
+
+        even_part *= 2;
+    }
+    odd_part = n;
+    //cout << "E = " << even_part << " O = " << odd_part << "\n";
+
+    if(odd_part == 1)
+    {
+        cout << "-1\n";
+        return;
+    }
+
+    cout << min(2*even_part, odd_part) << "\n";
+}
+
+int main()
+{
+    int no_of_test_cases;
+    cin >> no_of_test_cases;
+
+    while(no_of_test_cases--)
+        solve();
+
+    return 0;
+}
+
+
+

2022/Contests/Combined Divisions/CodeTON/Programs/Subtract Operation.cpp

@@ -0,0 +1,47 @@
+#include <iostream>
+#include <vector>
+#include <map>
+
+using namespace std;
+
+void solve()
+{
+    int no_of_elements, k;
+    cin >> no_of_elements >> k;
+
+    vector <long long> A(no_of_elements + 1);
+    for(int i = 1; i <= no_of_elements; i++)
+    {
+        cin >> A[i];
+    }
+
+    map <int, int> present;
+    for(int i = 1; i <= no_of_elements; i++)
+    {
+        present[A[i]] = true;
+    }
+
+    int possible = false;
+    for(int i = 1; i <= no_of_elements; i++)
+    {
+        if(present[A[i] - k] || present[A[i] + k])
+        {
+            possible = true;
+            break;
+        }
+    }
+
+    cout << (possible ? "Yes" : "No") << "\n";
+}
+
+int main()
+{
+    int no_of_test_cases;
+    cin >> no_of_test_cases;
+
+    while(no_of_test_cases--)
+        solve();
+
+    return 0;
+}
+