biweekly 105

Author: Pankajcoder1

Codeforces/After Placement/1833C-Vlad Building Beautiful Array.cpp

@@ -0,0 +1,52 @@
+/*
+    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> v(n);
+    for(auto &x1:v){
+        cin>>x1;
+    }
+    int minOdd=INT_MAX;
+    for(auto x1:v){
+        if(x1&1){
+            minOdd=min(minOdd,x1);
+        }
+    }
+    bool makeEven=true,makeOdd=true;
+    // for odd
+    for(auto x:v){
+        if(!(x&1) && x<=minOdd){
+            makeOdd=false;
+        }
+    }
+    // make even
+    for(auto x:v){
+        if((x&1) && x<=minOdd){
+            makeEven=false;
+        }
+    }
+    if(makeOdd || makeEven){
+        cout<<"YES"<<endl;
+    }
+    else{
+        cout<<"NO"<<endl;
+    }
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

Codeforces/After Placement/1837A-Grasshopper on a Line.cpp

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

Codeforces/After Placement/1837B-Comparison String.cpp

@@ -0,0 +1,40 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    int n;
+    string s;
+    cin>>n>>s;
+    int count=0,maxo=0;
+    for(int i=0;i<n;i++){
+        if(i==0){
+            count=1;
+        }
+        else{
+            if(s[i]==s[i-1]){
+                count++;
+            }
+            else{
+                count=1;
+            }
+        }
+        maxo=max(maxo,count);
+    }
+    cout<<maxo+1<<endl;
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

LeetCode/2698.Find the Punishment Number of an Integer.cpp

@@ -0,0 +1,28 @@
+/*
+    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:
+    bool check(int i){
+        string s=to_string(i*i);
+        
+    }
+    int punishmentNumber(int n)
+    {
+        int sum=0;
+        for(int i=1;i<=n;i++){
+            if(check(i)){
+                sum+=(i*i);
+            }
+        }
+        return sum;
+    }
+};

LeetCode/2707.Extra Characters in a String.cpp

@@ -0,0 +1,32 @@
+/*
+    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 minExtraChar(string s, vector<string> &dictionary)
+    {
+        int n = s.size();
+        vector<int> dp(n + 1, n);
+        dp[0] = 0;
+        for (int i = 0; i < n; i += 1)
+        {
+            for (auto t : dictionary)
+            {
+                if (s.substr(i, t.size()) == t)
+                {
+                    dp[i + t.size()] = min(dp[i + t.size()], dp[i]);
+                }
+            }
+            dp[i + 1] = min(dp[i + 1], dp[i] + 1);
+        }
+        return dp.back();
+    }
+};

LeetCode/2708.Maximum Strength of a Group.cpp

@@ -0,0 +1,31 @@
+/*
+    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 maxStrength(vector<int> &nums)
+    {
+        long long ans = nums[0];
+        for (int i = 1; i < (1 << nums.size()); i += 1)
+        {
+            long long pans = 1;
+            for (int j = 0; j < nums.size(); j += 1)
+            {
+                if ((i >> j) & 1)
+                {
+                    pans = pans * nums[j];
+                }
+            }
+            ans = max(ans, pans);
+        }
+        return ans;
+    }
+};