practice

Author: Pankajcoder1

Codeforces/1051A-Vasya_And_Password.cpp

@@ -0,0 +1,190 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+    Institute: National Institute of Technology, Uttarakhand
+*/
+#include <bits/stdc++.h>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/tree_policy.hpp>
+using namespace std;
+using namespace __gnu_pbds;
+typedef long long ll ;
+typedef unsigned long long ull;
+typedef vector<ll> vl;
+#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 line cout<<endl;
+#define pb push_back
+#define Endl "\n"
+// 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]<<" ";} line;
+#define precision(x) cout<<fixed<<setprecision(x);
+#define sz(V) ll(V.size())
+// template
+template <typename T>
+T mymax(T x,T y)
+{
+    return (x>y)?x:y;
+}
+// function
+ll power(ll x,ll y,ll mod)
+{
+    ll res=1;
+    // x=x%mod;
+    while(y>0)
+    {
+        if(y%2==1)
+        {
+            res*=x;
+            // res=res%mod;
+        }
+        y/=2; x*=x; // x=x%mod;
+    }
+    return res;
+}
+ll str_to_num(string s)
+{
+    stringstream pk(s);
+    ll num;
+    pk>>num;
+    return num;
+}
+
+string num_to_str(ll num)
+{
+    return to_string(num);
+}
+// datatype definination
+#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
+class Point
+{
+    public:
+        ll x;
+        ll y;
+        ll z;
+        ll getsum()
+        {
+            return x+y+z;
+        }
+};
+/* ascii value 
+A=65,Z=90,a=97,z=122
+*/
+/*  --------------------MAIN PROGRAM----------------------------*/
+// to run ctrl+b
+const ll INF=LONG_MAX;
+
+
+ll solve()
+{
+    string s;
+    cin>>s;
+    ll n=sz(s);
+    ll upper=0,lower=0,num=0;
+    for(auto x:s){
+        if(x>='A'&&x<='Z')
+            upper++;
+        else if(x>='a'&&x<='z')
+            lower++;
+        else
+            num++;
+    }
+    if(num==0&&lower==0){
+        s[0]='a',s[1]='1';
+    }
+    else if(lower==0&&upper==0)
+        s[0]='a',s[1]='A';
+    else if(num==0&&upper==0)
+        s[0]='1',s[1]='A';
+    else if(num==0){
+        if(upper>1){
+            for(ll i=0;i<n;i++){
+                if(isupper(s[i])){
+                    s[i]='1';
+                    break;
+                }
+            }
+        }
+        else{
+            for(ll i=0;i<n;i++){
+                if(islower(s[i])){
+                    s[i]='1';
+                    break;
+                }
+            }
+        }
+    }
+    else if(lower==0){
+        if(upper>1){
+            for(ll i=0;i<n;i++){
+                if(isupper(s[i])){
+                    s[i]='a';
+                    break;
+                }
+            }
+        }
+        else{
+            for(ll i=0;i<n;i++){
+                if(isdigit(s[i])){
+                    s[i]='a';
+                    break;
+                }
+            }
+        }
+    }
+    else if(upper==0){
+        if(lower>1){
+            for(ll i=0;i<n;i++){
+                if(islower(s[i])){
+                    s[i]='A';
+                    break;
+                }
+            }
+        }
+        else{
+            for(ll i=0;i<n;i++){
+                if(isdigit(s[i])){
+                    s[i]='A';
+                    break;
+                }
+            }
+        }
+    }
+    cout<<s<<endl;
+    return 0;
+}
+
+int main()
+{
+    speed;
+    /* #ifndef ONLINE_JUDGE
+        freopen("input.txt","r",stdin);
+        freopen("output.txt","w",stdout);
+    #endif */
+    ll TestCase=1;
+    cin>>TestCase;
+    while(TestCase--)
+    {
+        solve();
+    }
+}
+/* -----------------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/1245B-Restricted_RPS.cpp

@@ -0,0 +1,181 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+    Institute: National Institute of Technology, Uttarakhand
+*/
+#include <bits/stdc++.h>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/tree_policy.hpp>
+using namespace std;
+using namespace __gnu_pbds;
+typedef long long ll ;
+typedef unsigned long long ull;
+typedef vector<ll> vl;
+#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 line cout<<endl;
+#define pb push_back
+#define Endl "\n"
+// 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]<<" ";} line;
+#define precision(x) cout<<fixed<<setprecision(x);
+#define sz(V) ll(V.size())
+// template
+template <typename T>
+T mymax(T x,T y)
+{
+    return (x>y)?x:y;
+}
+// function
+ll power(ll x,ll y,ll mod)
+{
+    ll res=1;
+    // x=x%mod;
+    while(y>0)
+    {
+        if(y%2==1)
+        {
+            res*=x;
+            // res=res%mod;
+        }
+        y/=2; x*=x; // x=x%mod;
+    }
+    return res;
+}
+ll str_to_num(string s)
+{
+    stringstream pk(s);
+    ll num;
+    pk>>num;
+    return num;
+}
+
+string num_to_str(ll num)
+{
+    return to_string(num);
+}
+// datatype definination
+#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
+class Point
+{
+    public:
+        ll x;
+        ll y;
+        ll z;
+        ll getsum()
+        {
+            return x+y+z;
+        }
+};
+/* ascii value 
+A=65,Z=90,a=97,z=122
+*/
+/*  --------------------MAIN PROGRAM----------------------------*/
+// to run ctrl+b
+const ll INF=LONG_MAX;
+
+
+ll solve()
+{
+    ll n;
+    cin>>n;
+    ll a,b,c;
+    cin>>a>>b>>c;
+    map<char,ll> m;
+    m['R']=a;
+    m['P']=b;
+    m['S']=c;
+    string s,ans="";
+    ll win=0,lose=0;
+    cin>>s;
+    for(auto x:s){
+        if(x=='R'){
+            if(m['P']>0){
+                win++;
+                m['P']--;
+                b--;
+                ans+='P';
+            }
+            else
+                ans+='@';
+        }
+        else if(x=='P'){
+            if(m['S']>0){
+                c--;
+                win++;
+                m['S']--;
+                ans+='S';
+            }
+            else
+                ans+='@';
+        }
+        else if(x=='S'){
+            if(m['R']>0){
+                a--;
+                win++;
+                m['R']--;
+                ans+='R';
+            }
+            else
+                ans+='@';
+        }
+    }
+    if(win>=((n+1)/2)){
+        yes
+        for(ll i=0;i<n;i++){
+            if(ans[i]=='@'){
+                if(a>0){
+                    a--;
+                    ans[i]='R';
+                }
+                else if(b>0){
+                    b--;
+                    ans[i]='P';
+                }
+                else{
+                    c--;
+                    ans[i]='S';
+                }
+            }
+        }
+        cout<<ans<<endl;
+    }
+    else
+        no
+    return 0;
+}
+
+int main()
+{
+    speed;
+    /* #ifndef ONLINE_JUDGE
+        freopen("input.txt","r",stdin);
+        freopen("output.txt","w",stdout);
+    #endif */
+    ll TestCase=1;
+    cin>>TestCase;
+    while(TestCase--)
+    {
+        solve();
+    }
+}
+/* -----------------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
+*/