leetcode weekly 326

Author: Pankajcoder1

Codeforces/After Placement/1770A-Koxia and Whiteboards.cpp

@@ -0,0 +1,42 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    int n,m;
+    cin>>n>>m;
+    long long sum=0;
+    // bucket
+    priority_queue<int,vector<int>,greater<int>> pq;
+    for(int i=0;i<n;i++){
+        int temp;
+        cin>>temp;
+        pq.push(temp);
+    }
+    for(int i=0;i<m;i++){
+        int temp;
+        cin>>temp;
+        pq.pop();
+        pq.push(temp);
+    }
+    while(!pq.empty()){
+        sum+=pq.top();
+        pq.pop();
+    }
+    cout<<sum<<endl;
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

Codeforces/After Placement/1770B-Koxia and Permutation.cpp

@@ -0,0 +1,37 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    int n,k;
+    cin>>n>>k;
+    vector<int> v(n);
+    int first=n,second=1;
+    for(int i=0;i<n;i++){
+        if(i&1){
+            v[i]=second++;
+        }
+        else{
+            v[i]=first--;
+        }
+    }
+    for(int i=0;i<n;i++){
+        cout<<v[i]<<" ";
+    }
+    cout<<endl;
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

Codeforces/After Placement/1770C-Koxia and Number Theory.cpp

@@ -0,0 +1,48 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    long long n;
+    cin>>n;
+    vector<long long> v(n);
+    for(long long i=0;i<n;i++){
+        cin>>v[i];
+    }
+    sort(v.begin(),v.end());
+    // step 1
+    for(long long i=0;i+1<n;i++){
+        if(v[i]==v[i+1]){
+            cout<<"NO"<<endl;
+            return 0;
+        }
+    }
+    // step 2
+    for(int i=2;i<=n;i++){
+        vector<int>count(i,0);
+        for(int j=0;j<n;j++){
+            count[v[j]%i]++;
+        }
+        if(*min_element(count.begin(),count.end())>=2){
+            cout<<"NO"<<endl;
+            return 0;
+        }
+    }
+    
+    cout<<"YES"<<endl;
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

LeetCode/2520. Count the Digits That Divide a Number.cpp

@@ -0,0 +1,27 @@
+/*
+    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 countDigits(int num)
+    {
+        int count=0;
+        int temp=num;
+        while(temp){
+            int d=temp%10;
+            if(!(num%d)){
+                count++;
+            }
+            temp/=10;
+        }
+        return count;
+    }
+};

LeetCode/2521. Distinct Prime Factors of Product of Array.cpp

@@ -0,0 +1,42 @@
+/*
+    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 distinctPrimeFactors(vector<int> &nums)
+    {
+        
+        vector<int> check(10001,0);
+        vector<int> prime;
+        set<int> s;
+
+        for(int i=2;i<=10000;i++){
+            if (check[i] == 0)
+            {
+                prime.push_back(i);
+                for(int j=i;j<=10000;j+=i){
+                    check[j]++;
+                }
+            }
+        }
+        // size of prime is 1229
+        
+        for(auto x:nums){
+            for(auto y:prime){
+                if(x%y==0){
+                    s.insert(y);
+                }
+            }
+
+        }
+        return s.size();
+    }
+};

LeetCode/2522.Partition String Into Substrings With Values at Most K.cpp

@@ -0,0 +1,81 @@
+/*
+    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:
+    string num_to_str(int n){
+        string s="";
+        while(n>0){
+            s=char(n%10+'0')+s;
+            n/=10;
+        }
+        return s;
+    }
+    int compareString(string s1,string s2){
+        if(s1.size()>s2.size()){
+            return 1;
+        }
+        else if(s1.size()<s2.size()){
+            return -1;
+        }
+        else{
+            for(int i=0;i<s1.size();i++){
+                if(int(s1[i]-'0')>int(s2[i]-'0')){
+                    return 1;
+                }
+                else if(int(s1[i]-'0')<int(s2[i]-'0')){
+                    return -1;
+                }
+            }
+            return 0;
+        }
+    }
+
+    int minimumPartition(string s, int k)
+    {
+        for(auto x:s){
+            if(int(x-'0')>k){
+                return -1;
+            }
+        }
+
+        string k1=num_to_str(k);
+        int count=0;
+        // as previous substring
+        string temp="";
+
+        for(int i=0;i<s.size();i++){
+            string temp2=temp+s[i];
+            if(compareString(temp2,k1)==1){
+                // no need to add in previous substring
+                // one new substring will start
+                if(temp.size()==0){
+                    return -1;
+                }
+                else{
+                    // cout<<"temp is "<<temp<<endl;
+                    count++;
+                    temp=s[i];
+                }
+            }
+            else{
+                if(temp.size()==0){
+                    count++;
+                }
+                temp=temp2;
+            }
+
+        }
+        // cout<<"temp is "<<temp<<endl;
+        
+        return count;
+    }
+};

LeetCode/2523.Closest Prime Numbers in Range.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:
+    vector<int> closestPrimes(int left, int right)
+    {
+        vector<int> check(1e6+1,0);
+        vector<int> prime;
+        for(int i=2;i<=1e6;i++){
+            if(check[i]==0){
+                prime.push_back(i);
+                for(int j=i;j<=1e6;j+=i){
+                    check[j]++;
+                }
+            }
+        }
+        // size of prime is 78498
+        int mini=INT_MAX;
+        int a=-1,b=-1;
+        for(int i=0;i+1<prime.size();i++){
+            if(prime[i]>=left && prime[i+1]<=right){
+                if(prime[i+1]-prime[i]<mini){
+                    mini=prime[i+1]-prime[i];
+                    a=prime[i];
+                    b=prime[i+1];
+                }
+            }
+        }
+        return {a,b};
+    }
+};

Template/cpp.json

@@ -568,7 +568,7 @@
 			"}",
 			"int main()",
 			"{",
-			"	long long testCase;",
+			"	int testCase=1;",
     		"	cin>>testCase;",
     		"	while(testCase--){",
 			"		solve();",