codeforces

Author: Pankajcoder1

Codeforces/After Placement/1743A-Password.cpp

@@ -0,0 +1,46 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+/* ascii value
+A=65,Z=90,a=97,z=122
+*/
+
+// Techniques :
+// divide into cases, brute force, pattern finding
+// sort, greedy, binary search, two pointer
+// transform into graph
+
+
+int solve(){
+    int n;
+    cin>>n;
+    vector<int> v(n);
+    for(int i=0;i<n;i++){
+        cin>>v[i];
+    }
+    cout<<3*(10-n)+(9-n)<<endl;
+    return 0;
+}
+int main()
+{
+    long long testCase;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}
+/* -----------------END OF PROGRAM --------------------*/
+/*
+* stuff you should look before submission
+* constraint and time limit
+* int overflow
+* special test case (n=0||n=1||n=2)
+* don't get stuck on one approach if you get wrong answer
+*/

Codeforces/After Placement/1744A-Number_Replacement.cpp

@@ -0,0 +1,56 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+/* ascii value
+A=65,Z=90,a=97,z=122
+*/
+
+// Techniques :
+// divide into cases, brute force, pattern finding
+// sort, greedy, binary search, two pointer
+// transform into graph
+int solve(){
+    int n;
+        cin>>n;
+        vector<int> v(n);
+        for(int i=0;i<n;i++){
+            cin>>v[i];
+        }
+        string s;
+        cin>>s;
+        map<int,set<char>> m;
+        for(int i=0;i<n;i++){
+            m[v[i]].insert(s[i]);
+        }
+        for(auto x:m){
+            if(x.second.size()>1){
+                cout<<"NO"<<endl;
+                return 0;
+            }
+        }
+        cout<<"YES"<<endl;
+}
+
+int main()
+{
+    long long testCase;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}
+/* -----------------END OF PROGRAM --------------------*/
+/*
+* stuff you should look before submission
+* constraint and time limit
+* int overflow
+* special test case (n=0||n=1||n=2)
+* don't get stuck on one approach if you get wrong answer
+*/

Codeforces/After Placement/1744B-Even-Odd_Increments.cpp

@@ -0,0 +1,69 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+/* ascii value
+A=65,Z=90,a=97,z=122
+*/
+
+// Techniques :
+// divide into cases, brute force, pattern finding
+// sort, greedy, binary search, two pointer
+// transform into graph
+
+
+int main()
+{
+    long long testCase;
+    cin>>testCase;
+    while(testCase--){
+        int n,q;
+        cin>>n>>q;
+        long long temp,evenCount=0,oddCount=0;
+        long long sum=0;
+        for(int i=0;i<n;i++){
+            cin>>temp;
+            if(temp%2==0){
+                evenCount++;
+                sum+=temp;
+            }
+            else{
+                oddCount++;
+                sum += temp;
+            }
+        }
+        while(q--){
+            int type,x;
+            cin>>type>>x;
+            if(type==1){
+                sum+=oddCount*x;
+                if(x&1){
+                    evenCount+=oddCount;
+                    oddCount=0;
+                }
+            }
+            else{
+                sum+=(evenCount*x);
+                if(x&1){
+                    oddCount+=evenCount;
+                    evenCount=0;
+                }
+            }
+            cout<<sum<<endl;
+        }
+    }
+    return 0;
+}
+/* -----------------END OF PROGRAM --------------------*/
+/*
+* stuff you should look before submission
+* constraint and time limit
+* int overflow
+* special test case (n=0||n=1||n=2)
+* don't get stuck on one approach if you get wrong answer
+*/

Codeforces/After Placement/1744C-Traffic_Light.cpp

@@ -0,0 +1,77 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+/* ascii value
+A=65,Z=90,a=97,z=122
+*/
+
+// Techniques :
+// divide into cases, brute force, pattern finding
+// sort, greedy, binary search, two pointer
+// transform into graph
+
+
+int solve(){
+    int n;
+    char ch;
+    cin>>n>>ch;
+    string s;
+    cin>>s;
+    if(ch=='g'){
+        cout<<0<<endl;
+        return 0;
+    }
+
+    int first=-1;
+    int ans=0;
+    for(int i=0;i<n;i++){
+        if(s[i]=='g'){
+            first=i;
+            break;
+        }
+    }
+    for(int i=0;i<n;i++){
+        if(s[i]==ch){
+            int count=0,flag=0;
+            for(int j=i+1;j<n;j++){
+                count++;
+                if(s[j]=='g'){
+                    flag++;
+                    break;
+                }
+            }
+            i=i+count;
+            if(flag){
+                ans=max(ans,count);
+            }
+            else{
+                ans=max(ans,count+1+first);
+            }
+        }
+    }
+    cout<<ans<<endl;        
+    return 0;
+}
+int main()
+{
+    long long testCase;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}
+/* -----------------END OF PROGRAM --------------------*/
+/*
+* stuff you should look before submission
+* constraint and time limit
+* int overflow
+* special test case (n=0||n=1||n=2)
+* don't get stuck on one approach if you get wrong answer
+*/

Codeforces/After Placement/1746C-Permutation_Operations.cpp

@@ -0,0 +1,46 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+/* ascii value
+A=65,Z=90,a=97,z=122
+*/
+
+// Techniques :
+// divide into cases, brute force, pattern finding
+// sort, greedy, binary search, two pointer
+// transform into graph
+
+int main()
+{
+    long long testCase;
+    cin >> testCase;
+    while (testCase--)
+    {
+        int n,temp;
+        cin >> n;
+        vector<int> ans(n);
+        for (int i = 0; i < n; i++)
+        {
+            cin>>temp;
+            ans[n-temp]=i+1;
+        }
+        for(auto x:ans){
+            cout<<x<<" ";
+        }
+        cout<<endl;
+    }
+    return 0;
+}
+/* -----------------END OF PROGRAM --------------------*/
+/*
+ * stuff you should look before submission
+ * constraint and time limit
+ * int overflow
+ * special test case (n=0||n=1||n=2)
+ * don't get stuck on one approach if you get wrong answer
+ */

LeetCode/344.Reverse_String.cpp

@@ -1,41 +1,14 @@
 /*
     written by Pankaj Kumar.
     country:-INDIA
-    Institute: National Institute of Technology, Uttarakhand
 */
 typedef long long ll ;
-typedef unsigned long long ull;
-typedef vector<int> vl;
-typedef vector<vector<int>> vvl;
-#define speed cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
-/*  Abbrevations  */
-#define ff first
-#define ss second
-#define mp make_pair
-#define pb push_back
-// loops
-#define forin(arr,n) for(ll i=0;i<n;i++) cin>>arr[i];
-// Some print
-#define no cout<<"NO"<<endl;
-#define yes cout<<"YES"<<endl;
-// sort
-#define all(V) (V).begin(),(V).end()
-#define srt(V) sort(all(V))
-#define srtGreat(V) sort(all(V),greater<ll>())
-// some extra
-#define printv(v) for(ll i=0;i<ll(v.size());i++){cout<<v[i]<<" ";} cout<<endl;
-#define precision(x) cout<<fixed<<setprecision(x);
-#define sz(V) ll(V.size())
 
 
 /* ascii value
 A=65,Z=90,a=97,z=122
 */
 
-/* Some syntax 
-//Syntax to create a min heap for priority queue
-//priority_queue <int, vector<int>, greater<int>>pq;
-*/
 /*  --------------------MAIN PROGRAM----------------------------*/
 // to run ctrl+b
 const ll INF=1e18;
@@ -51,16 +24,21 @@ const ll mod2=998244353;
 
 
 //Add main code here
-class Solution {
+
+class Solution
+{
 public:
-    void reverseString(vector<char>& s) {
-        reverse(s.begin(),s.end());
+    void reverseString(vector<char> &s)
+    {
+        int n = s.size();
+        for (int i = 0; i < n / 2; i++)
+        {
+            swap(s[i], s[n - i - 1]);
+        }
+        return ;
     }
 };
 
-
-
-
 /* -----------------END OF PROGRAM --------------------*/
 /*
 * stuff you should look before submission