leetcode 2218

Author: Pankajcoder1

Codeforces/After Placement/1797B.Li Hua and Pattern.cpp

@@ -0,0 +1,56 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    int a, b;
+    cin>>a>>b;
+    vector<vector<int>> x(a+1,vector<int>(a+1,0));
+
+    for (int i = 1; i <= a; i++){
+        for (int j = 1; j <= a; j++){
+            cin>>x[i][j];
+        }
+    }
+
+    int sum = 0;
+    for (int i = 1; i <= a; i++){
+        for (int j = 1; j <= a; j++){
+            if (x[i][j] != x[a - i + 1][a - j + 1]){
+                sum++;
+            }
+        }
+    }
+
+    sum /= 2;
+    if(sum>b){
+        cout<<"NO"<<endl;
+        return 0;
+    }
+    b-=sum;
+    if(a&1){
+        cout<<"YES"<<endl;
+    }
+    // size of matrix -> even
+    else if(b&1){
+        cout<<"NO"<<endl;
+    }
+    else{
+        cout << "YES" << endl;
+    }
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

Codeforces/After Placement/1814B-Long Legs.cpp

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

LeetCode/2218.Maximum Value of K Coins From Piles.cpp

@@ -0,0 +1,34 @@
+/*
+    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:
+    int maxValueOfCoins(vector<vector<int>> &piles, int k)
+    {
+        int n=piles.size();
+        vector<vector<int>> dp(n+1, vector<int>(k+1,0));
+
+        for(int noOfPiles=1;noOfPiles<=n;noOfPiles++){
+            // noOfPiles -> currently aab tak itne pile select kiye coin lene ke liye
+            for(int noOfCoin=1;noOfCoin<=k;noOfCoin++){
+                // noOfCoin -> aab tak total itne coin select kiye
+                dp[noOfPiles][noOfCoin]+=dp[noOfPiles-1][noOfCoin];
+                int sum=0;
+                for(int takeCoin=1;takeCoin<=min(noOfCoin,(int)piles[noOfPiles-1].size());takeCoin++){
+                    // takeCoin -> currect pile se itne coin select kiye
+                    sum += piles[noOfPiles - 1][takeCoin-1];
+                    dp[noOfPiles][noOfCoin] = max(dp[noOfPiles][noOfCoin], dp[noOfPiles - 1][noOfCoin - takeCoin] + sum);
+                }
+            }
+        }
+        return dp[n][k];
+    }
+};