idk

Author: muditmahajan21

Diff for: CSES/1643

@@ -0,0 +1,34 @@
+#include "bits/stdc++.h"
+using namespace std;
+#define endl "\n"
+#define ll long long int 
+
+int main()
+{
+        int n;
+        cin >> n;
+        int arr[n];
+        for(int i = 0; i < n; i++) {
+                cin >> arr[i];
+        }
+        int ans = 0;
+        int curr = 0;
+        
+        for(int i = 0; i < n; i++)
+        {
+        	if(arr[i] >= 0) 
+        	{
+        		curr += arr[i];
+        	}
+        	else 
+        	{
+        		ans = max(ans, curr);
+        		curr = 0;
+        	}
+        }
+        cout << curr << " \n";
+        ans = max(ans, curr);
+
+        cout << ans << endl;
+        return 0;
+}

Diff for: CSES/1643.cpp

@@ -0,0 +1,2 @@
+10
+24 7 -27 17 -67 65 -23 58 85 -39

Diff for: CSES/in

@@ -84,4 +84,56 @@ int main()
     }
 
 return 0;
-}
+}
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+

Diff for: Codechef/2021/Codechef_Starters_11_2021/Positive_Spewing.cpp

@@ -0,0 +1,67 @@
+#include <bits/stdc++.h>
+#define ll long long int
+#define endl "\n"
+using namespace std;
+
+int main()
+{   
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    ll test;
+    cin >> test;
+    while(test--)
+    {
+        ll i, j, k, n, m, temp, count = 0, ans = 0, sum = 0;
+        cin >> n >> m;
+        vector<string> arr;
+        string s;
+        for(i = 0; i < n; i++)
+        {   
+            cin >> s;
+            arr.push_back(s);
+        }
+       
+        vector<pair<ll, string>> pls;       
+
+        for(auto e: arr)
+        {
+            bool one = false;
+            count = 0;
+            ans = 0;
+            for(auto f: e)
+            {   
+                if(f == '0')ans++;
+            }
+            pls.push_back( {ans, e} );
+        }
+
+        sort(pls.begin(), pls.end(), greater<pair<ll, string>>());
+        string t = "";
+
+        for(auto e: pls) 
+        {
+            t += e.second;
+        }
+
+        bool one = false;
+        count = 0;
+        ans = 0;
+        for(auto f: t)
+        {   
+            if(f == '1')
+            {   
+                one = true;
+                count++;
+            }
+            else
+            {   
+                if(one)
+                ans += count;
+            }
+        }
+
+        cout << ans << endl;
+    }
+
+return 0;
+}

Diff for: Codechef/2021/Codechef_Starters_17_2021/Binary_Inversion.cpp

@@ -0,0 +1,44 @@
+#include <bits/stdc++.h>
+#define ll long long int
+#define endl "\n"
+using namespace std;
+
+int main()
+{   
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    ll test;
+    cin >> test;
+    while(test--)
+    {
+        ll i, j, k, n, temp, count = 0, ans = 0, sum = 0;
+        cin >> n;
+        ll arr[n];
+        
+        for(i = 0; i < n; i++)
+        {
+            cin >> arr[i];
+        }
+
+        for(i = 1; i < n; i++)
+        {
+            if(arr[i] > arr[i - 1] || arr[i - 1] % arr[i] != 0) 
+            {
+                sum = 1;
+                break;
+            }
+        }
+
+        if(sum || count) cout << -1 << endl;
+        else
+        {
+            for(i = 0; i < n; i++)
+            {
+                cout << arr[i] << " ";
+            }
+            cout << endl;
+        }
+    }
+
+return 0;
+}

Diff for: Codechef/2021/Codechef_Starters_17_2021/GCD_of_Prefixes.cpp

@@ -0,0 +1,37 @@
+#include <bits/stdc++.h>
+#define ll long long int
+#define endl "\n"
+using namespace std;
+
+int main()
+{   
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    ll test;
+    cin >> test;
+    while(test--)
+    {
+        ll i, j, k, n, temp, count = 0, ans = 0, sum = 0;
+        ll a, b, p, q;
+        cin >> a >> b >> p >> q;
+
+        i = a + b;
+        j = p + q;
+
+        if(i % 2 == j % 2) 
+        {
+            ans = 2;
+        }
+        else
+        {
+            ans = 1;
+        }
+        if(a == p and b == q)
+        {
+            ans = 0;
+        }
+        cout << ans << endl;
+    }
+
+return 0;
+}

Diff for: Codechef/2021/Codechef_Starters_17_2021/New_Piece.cpp

@@ -0,0 +1,44 @@
+#include <bits/stdc++.h>
+#define ll long long int
+#define endl "\n"
+using namespace std;
+
+int main()
+{   
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    ll test;
+    cin >> test;
+    while(test--)
+    {
+        ll i, j, k, n, temp, count = 0, ans = 0, sum = 0;
+        cin >> n >> k;
+
+        vector<ll> arr;
+        for(i = 1; i < n / 2; i++)
+        {
+            if(i * 2 <= n)
+            {
+                ans += 2;
+                arr.push_back(i);
+                arr.push_back(i * 2);
+            }
+        }
+
+        if(ans <= k || ans % k == 0)
+        {
+            cout << "Yes" << endl;
+            for(i = 0; i < k; i++)
+            {
+                cout << arr[i] << " ";
+            }
+            cout << endl;
+        }
+        else
+        {
+            cout << "No" << endl;
+        }
+    }
+
+return 0;
+}

Diff for: Codechef/2021/Codechef_Starters_17_2021/Partition_It.cpp

@@ -0,0 +1,44 @@
+#include <bits/stdc++.h>
+#define ll long long int
+#define endl "\n"
+using namespace std;
+
+int main()
+{   
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    ll test;
+    cin >> test;
+    while(test--)
+    {
+        ll i, j, k, n, temp, ans = 0, sum = 0;
+        cin >> n;
+        string s;
+        cin >> s;
+                                                                     
+        ll one = 0;
+        ll zero = 0;
+
+        for(auto e: s) if(e == '0') zero++;
+        one = n - zero;
+
+        ans = min(one, zero);
+
+        if(!ans) 
+        {
+            sum = 1;
+        }
+
+        if(ans >= 2)
+        {
+            temp = one + zero - (2 * ans);
+            if(temp % 2 == 0) sum = 1;
+        }
+
+        if(!sum) cout << "Alice";
+        else cout << "Bob";
+        cout << endl;
+    }
+
+return 0;
+}

Diff for: Codechef/2021/Codechef_Starters_17_2021/String_Game.cpp

@@ -0,0 +1,24 @@
+#include <bits/stdc++.h>
+#define ll long long int
+#define endl "\n"
+using namespace std;
+
+int main()
+{   
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    ll test;
+    cin >> test;
+    while(test--)
+    {
+        ll i, j, k, n, temp, count = 0, ans = 0, sum = 0;
+        cin >> n;
+        if(n == 2) ans = 2;
+        else {
+            ans = n - 1;
+        }
+        cout << ans << endl;
+    }
+
+return 0;
+}

Diff for: Codechef/Codechef_SnackDown_2021/Pre_Elimination/Disabled_King.cpp

@@ -0,0 +1,22 @@
+#include <bits/stdc++.h>
+#define ll long long int
+#define endl "\n"
+using namespace std;
+
+int main()
+{   
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    ll test;
+    cin >> test;
+    while(test--)
+    {
+        ll i, j, k, n, temp, count = 0, ans = 0, sum = 0;
+        cin >> i >> j;
+        if((i + j) % 2) cout << "Alice";
+        else cout << "Bob";
+        cout << endl;
+    }
+
+return 0;
+}