leetcode 2546

Author: Pankajcoder1

Codeforces/After Placement/1777B-Emordnilap.cpp

@@ -0,0 +1,37 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+long long mod=1e9+7;
+
+long long factorial(int n){
+    long long ans=1;
+    for(int i=1;i<=n;i++){
+        ans*=i;
+        ans%=mod;
+    }
+    return ans;
+}
+
+
+int solve(){
+    int n;
+    cin>>n;
+    long long ans=(long long)n*(n-1);
+    ans%=mod;
+    ans=(ans*factorial(n))%mod;
+    cout<<ans<<endl;
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

LeetCode/2545. Sort the Students by Their Kth Score.cpp

@@ -0,0 +1,20 @@
+/*
+    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<vector<int>> sortTheStudents(vector<vector<int>> &score, int k)
+    {
+        sort(begin(score), end(score), [&](vector<int> a, vector<int> b)
+             { return a[k] > b[k]; });
+        return score;
+    }
+};

LeetCode/2546. Apply Bitwise Operations to Make Strings Equal.cpp

@@ -0,0 +1,26 @@
+/*
+    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 makeStringsEqual(string s, string target)
+    {
+        int one1=0,one2=0;
+        one1=count(s.begin(),s.end(),'1');
+        one2=count(target.begin(),target.end(),'1');
+        if(one1==0 || one2==0){
+            return s==target;
+        }
+        else{
+            return true;
+        }
+    }
+};