leetcode

Author: Pankajcoder1

Codeforces/After Placement/1041B-Buying a TV Set.cpp

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

Codeforces/After Placement/1777A-Everybody Likes Good Arrays!.cpp

@@ -0,0 +1,48 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+int parity(int n){
+    if(n%2==0){
+        return 0;
+    }
+    else{
+        return 1;
+    }
+}
+
+int solve(){
+    int n;
+    cin>>n;
+    stack<int> s;
+    vector<int> v(n);
+    for(int i=0;i<n;i++){
+        cin>>v[i];
+    }
+    s.push(v[0]);
+    for(int i=1;i<n;i++){
+        if(parity(s.top())==parity(v[i])){
+            int temp=s.top();
+            s.pop();
+            s.push(temp*v[i]);
+        }
+        else{
+            s.push(v[i]);
+        }
+    }
+    cout<<n-s.size()<<endl;
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

LeetCode/2536. Increment Submatrices by One.cpp.cpp

@@ -0,0 +1,40 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+typedef long long ll ;
+const ll INF=1e18;
+const ll mod1=1e9+7;
+const ll mod2=998244353;
+//Add main code here
+
+class Solution
+{
+public:
+    long long minOperations(vector<int> &nums1, vector<int> &nums2, int k)
+    {
+        if(k==0){
+            return nums1==nums2?0:-1;
+        }
+        long long countPos=0,countNeg=0;
+        for(int i=0;i<nums1.size();i++){
+            long long diff=nums1[i]-nums2[i];
+            if(diff%k){
+                return -1;
+            }
+            else if(diff>0){
+                countPos+=diff/k;
+            }
+            else{
+                countNeg+=diff/k;
+            }
+
+        }
+        if(countPos+countNeg==0){
+            return countPos;
+        }
+        else{
+            return -1;
+        }
+    }
+};