cf

Author: Pankajcoder1

Codeforces/After Placement/1181A-Chunga-Changa.cpp

@@ -0,0 +1,27 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+int solve()
+{
+    long long x,y,z;
+    cin >> x >> y >> z;
+    if(x%z+y%z<z)
+        cout<<(x+y)/z<<" "<<0<<endl;
+    else
+        cout<<(x+y)/z<<" "<<min(z-x%z,z-y%z)<<endl;
+    return 0;
+}
+int main()
+{
+    int testCase = 1;
+    while (testCase--)
+    {
+        solve();
+    }
+    return 0;
+}

Codeforces/After Placement/1780A-Hayato and School.cpp

@@ -0,0 +1,55 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+int solve()
+{
+    int n;
+    cin >> n;
+    vector<int> a(n), odd, even;
+    for (int i = 0; i < n; i++)
+    {
+        cin >> a[i];
+        (a[i] % 2 ? odd : even).push_back(i);
+    }
+    vector<int> temp;
+    for (int i = 0; i < 3 && i < odd.size(); i++)
+    {
+        temp.push_back(odd[i]);
+    }
+    for (int i = 0; i < 3 && i < even.size(); i++)
+    {
+        temp.push_back(even[i]);
+    }
+    for (int i : temp)
+    {
+        for (int j : temp)
+        {
+            for (int k : temp)
+            {
+                if (i != j && j != k && k != i && (a[i] + a[j] + a[k]) % 2)
+                {
+                    cout << "YES\n";
+                    cout << i + 1 << " " << j + 1 << " " << k + 1 << "\n";
+                    return 0;
+                }
+            }
+        }
+    }
+    cout << "NO\n";
+    return 0;
+}
+int main()
+{
+    int testCase = 1;
+    cin >> testCase;
+    while (testCase--)
+    {
+        solve();
+    }
+    return 0;
+}

Codeforces/After Placement/1792A-GamingForces.cpp

@@ -0,0 +1,31 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    int n,ones=0;
+    cin>>n;
+    for (int i = 0; i < n; i++)
+    {
+        int x;
+        cin>>x;
+        if (x == 1)
+            ones++;
+    }
+    printf("%d\n", n - ones / 2);
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

Codeforces/After Placement/1792B-Stand-up Comedian.cpp

@@ -0,0 +1,33 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+int solve()
+{
+    int a, b, c, d;
+    cin >> a >> b >> c >> d;
+    if (a == 0)
+    {
+        cout << 1 << endl;
+        return 0;
+    }
+    int ans = a;
+    ans += 2 * min(b, c);
+    ans += min(a + 1, abs(c - b) + d);
+    cout << ans << endl;
+    return 0;
+}
+int main()
+{
+    int testCase = 1;
+    cin >> testCase;
+    while (testCase--)
+    {
+        solve();
+    }
+    return 0;
+}