Add files via upload

Author: MathProgrammer

2022/Contests/Div 3/828/Programs/Divisibility by 2^n.cpp

@@ -0,0 +1,69 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+#include <map>
+
+#define all(v) (v).begin() + 1, (v).end()
+using namespace std;
+
+int power_2(int n)
+{
+    int power = 0;
+
+    while(n%2 == 0 && n > 0)
+    {
+        power++;
+        n /= 2;
+    }
+
+    return power;
+}
+
+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];
+    }
+
+    vector <int> index_power(no_of_elements + 1);
+    for(int i = 1; i <= no_of_elements; i++)
+    {
+        index_power[i] = power_2(i);
+    }
+
+    sort(all(index_power));
+    reverse(all(index_power));
+
+    int total_power = 0;
+    for(int i = 1; i <= no_of_elements; i++)
+    {
+        total_power += power_2(A[i]);
+    }
+
+    int no_of_operations = 0;
+    for(int i = 1; i <= no_of_elements && total_power < no_of_elements && index_power[i] > 0; i++)
+    {
+        total_power += index_power[i];
+        no_of_operations++;
+    }
+
+    const int NOT_POSSIBLE = -1;
+    cout << (total_power < no_of_elements ? NOT_POSSIBLE : no_of_operations) << "\n";
+}
+
+int main()
+{
+    int no_of_test_cases;
+    cin >> no_of_test_cases;
+
+    while(no_of_test_cases--)
+        solve();
+
+    return 0;
+}
+

2022/Contests/Div 3/828/Programs/Even-Odd Increments.cpp

@@ -0,0 +1,92 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+#include <map>
+
+using namespace std;
+
+void solve()
+{
+    int no_of_elements, no_of_queries;
+    cin >> no_of_elements >> no_of_queries;
+
+    long long even_sum = 0, odd_sum = 0;
+    long long even_count = 0, odd_count = 0;
+    vector <int> A(no_of_elements + 1);
+    for(int i = 0; i < no_of_elements; i++)
+    {
+        cin >> A[i];
+
+        if(A[i]%2 == 0)
+        {
+            even_sum += A[i];
+            even_count++;
+        }
+        else if(A[i]%2 == 1)
+        {
+            odd_sum += A[i];
+            odd_count++;
+        }
+    }
+
+    for(int i = 1; i <= no_of_queries; i++)
+    {
+        const int ADD_EVEN = 0, ADD_ODD = 1;
+        long long query, value;
+        cin >> query >> value;
+
+        switch(query)
+        {
+            case ADD_EVEN : {
+                                if(value%2 == 0)
+                                {
+                                    even_sum += even_count*value;
+                                }
+                                else
+                                {
+                                    even_sum += even_count*value;
+                                    odd_sum += even_sum;
+                                    even_sum = 0;
+
+                                    odd_count += even_count;
+                                    even_count = 0;
+                                }
+
+                                break;
+                            }
+
+            case ADD_ODD : {
+                                if(value%2 == 0)
+                                {
+                                    odd_sum += odd_count*value;
+                                }
+                                else
+                                {
+                                    odd_sum += odd_count*value;
+                                    even_sum += odd_sum;
+                                    odd_sum = 0;
+
+                                    even_count += odd_count;
+                                    odd_count = 0;
+                                }
+
+                                break;
+
+                            }
+        }
+
+        cout << even_sum + odd_sum << "\n";
+    }
+}
+
+int main()
+{
+    int no_of_test_cases;
+    cin >> no_of_test_cases;
+
+    while(no_of_test_cases--)
+        solve();
+
+    return 0;
+}
+

2022/Contests/Div 3/828/Programs/Number Replacement.cpp

@@ -0,0 +1,50 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+#include <map>
+
+using namespace std;
+
+void solve()
+{
+    int no_of_elements;
+    cin >> no_of_elements;
+
+    vector <int> A(no_of_elements + 1);
+    for(int i = 0; i < no_of_elements; i++)
+    {
+        cin >> A[i];
+    }
+
+    string S;
+    cin >> S;
+
+    map <int, char> dictionary;
+    int possible = true;
+    for(int i = 0; i < S.size(); i++)
+    {
+        if(dictionary[A[i]] != 0)
+        {
+            if(dictionary[A[i]] != S[i])
+            {
+                possible = false;
+                break;
+            }
+        }
+
+        dictionary[A[i]] = S[i];
+    }
+
+    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;
+}

2022/Contests/Div 3/828/Programs/Traffic Light.cpp

@@ -0,0 +1,67 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+#include <map>
+
+using namespace std;
+
+void solve()
+{
+    int no_of_elements;
+    char symbol;
+    cin >> no_of_elements >> symbol;
+
+    string S;
+    cin >> S;
+
+    const char GREEN = 'g';
+    int first_green = 0;
+    for(int i = 0; i < no_of_elements; i++)
+    {
+        if(S[i] == GREEN)
+        {
+            first_green = i;
+            break;
+        }
+    }
+
+    const int NO_GREEN_TO_RIGHT = -1;
+    vector <int> nearest_green(no_of_elements + 1, NO_GREEN_TO_RIGHT);
+    for(int i = no_of_elements - 1; i >= 0; i--)
+    {
+        nearest_green[i] = (S[i] == GREEN ? i : nearest_green[i + 1]);
+
+        if(nearest_green[i] == NO_GREEN_TO_RIGHT)
+        {
+            nearest_green[i] = first_green;
+        }
+
+        //cout << "nearest green " << i << " = " << nearest_green[i] << "\n";
+    }
+
+    int answer = 0;
+    for(int i = 0; i < no_of_elements; i++)
+    {
+        if(S[i] == symbol)
+        {
+            int distance = (nearest_green[i] >= i ? nearest_green[i] - i : S.size() - i + first_green);
+
+            answer = max(answer, distance);
+        }
+    }
+
+    cout << answer << "\n";
+}
+
+int main()
+{
+    int no_of_test_cases;
+    cin >> no_of_test_cases;
+
+    while(no_of_test_cases--)
+        solve();
+
+    return 0;
+}
+
+