Codeforces Round 942 (Div. 2)( 4 / 7 )

A - Contest Proposal

#include<bits/stdc++.h>
using namespace std;
void solve(){
    int n,ans=0;
    cin>>n;
    vector<int>a(n+1),b(n+1);
    for(int i=0;i<n;i++)cin>>a[i];
    for(int i=0;i<n;i++)cin>>b[i];
    for(int i=0;i<n;i++){
        int j=0;
        while(a[i]>b[j+i]&&j+i<n){
            j++;
            ans=max(ans,j);
            // cout<<ans<<endl;
        }
    }
    cout<<ans<<endl;
}
int main(){
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t;
    cin>>t;
    //t=1;
    while(t--)solve();
    return 0;
}

B - Coin Games

#include<bits/stdc++.h>
using namespace std;
void solve(){
    int n,ans=0;
    string s;
    cin>>n>>s;
    for(int i=0;i<s.length();i++){
        if(s[i]=='U')ans++;
    }
    if(ans&1)cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
}
int main(){
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t;
    cin>>t;
    //t=1;
    while(t--)solve();
    return 0;
}

D1 - Reverse Card (Easy Version)

#include<bits/stdc++.h>
#define int long long
using namespace std;
void solve(){
    int m,n;
    cin>>m>>n;
    int ans=m;
    for(int i=1;i<=n;i++){
        if(i!=1&&m!=1&&n!=1)ans+=(m+i)/(i*i);
    }
    cout<<ans<<endl;
}
signed main(){
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t;
    cin>>t;
    //t=1;
    while(t--)solve();
    return 0;
}

C - Permutation Counting

#include<bits/stdc++.h>
#define int long long
using namespace std;
void solve(){
    int n,k;
    cin>>n>>k;
    vector<int>a(n);
    for(int i=0;i<n;i++)cin>>a[i];
    sort(a.begin(),a.end());
    for(int i=0;i<n-1;i++){
        int pos=a[i+1]-a[i];
        if(k>=pos*(i+1))k-=pos*(i+1);
        else{
            a[i]+=(int)k/(i+1);
            k=k%(i+1);
            cout<<a[i]*n-(i-k)<<endl;
            return;
        }
    }
    cout<<a[n-1]*n-(n-1-k)<<endl;
}
signed main(){
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t;
    cin>>t;
    //t=1;
    while(t--)solve();
    return 0;
}