Codeforces Round #573 (Div. 2)

Codeforces Round #573 (Div. 2)

A

# include <bits/stdc++.h>
using namespace std;
​
int main()
{
    int x;
    scanf("%d",&x);
    
    int b=x%4;
    
    if(b==1){
        printf("0 A");
    }else if(b==2){
        printf("1 B");
    }else if(b==3){
        printf("2 A");
    }else if(b==0){
        printf("1 A");
    }
    
    return 0;
 } 
​

B

# include <bits/stdc++.h>
using namespace std;
​
int main()
{
    string a,b,c;
    int x=0,y=0;
    int s[3];
    cin>>a>>b>>c;
    
    s[0]=a[0]-'0';
    s[1]=b[0]-'0';
    s[2]=c[0]-'0';
    int maxx,minn,midd;
    maxx=max(max(s[0],s[1]),s[2]);
    minn=min(min(s[0],s[1]),s[2]);
    for(int i=0;i<3;i++){
        if(s[i]!=maxx&&s[i]!=minn) {
            midd=s[i];
            break;
        }   
    }
    
    if(a==b&&b==c){
        printf("0");
        return 0;
    }else if(a[1]==b[1]&&b[1]==c[1]&&(midd-minn)==1&&(maxx-midd)==1){
        printf("0");
        return 0;
    }else if(a==b||a==c||c==b){
        x=1;
    }else if(a[1]==b[1])&&a[0]){
        
    }
    
        
    
    
    
    
    {
        if(a==b||b==c||c==a){
            x=1;
        }else{
            x=2;
        }
    }
    
    
    if(a[1]==b[1]&&b[1]==c[1]){
        //printf("@@@\n");
        if((midd-minn)==1&&(maxx-midd)==1){
            printf("0");
            return 0;
        }else{
            if((midd-minn)==1||(maxx-midd)==1){
                y=1;
            }else if((midd-minn)==2||(maxx-midd)==2){
                y=1;
            }else{
                y=2;
            }
        }
    }else{
        //printf("@@@\n");
        if(a[1]==b[1]&&s[0]!=s[1]){
            //cout<<"@@@@"<<endl;
            y=1;
        }else if(c[1]==b[1]&&s[1]!=s[2]){
            //cout<<"@@@@"<<endl;
            y=1;
        }else if(a[1]==c[1]&&s[0]!=s[2]){
            //cout<<"@@@@"<<endl;
            y=1;
        }else{
y=2;
    }
    }

printf("%d",min(x,y));
return 0;
}
​

C

# include <bits/stdc++.h>
using namespace std;
​
typedef long long LL;
const int MAXN=1e5+100;
LL p[MAXN];
int main()
{
    LL n,m,k;
    LL ans=0;
    
    scanf("%lld %lld %lld",&n,&m,&k);
    
    for(int i=1;i<=m;i++){
        scanf("%lld",&p[i]);
    }
    
    int a=0,b=1;
    for(int i=1;i<=m;i++){
        if(p[i]<b*k){
            if(ans&&i==m) ans++;
            a++;
        }else if(p[i]==b*k){
            a++;
            ans++;
        }else{
            p[i]=p[i]-a;
            i--;
            a=0;
            if(p[i]>b*k) b++;
        }
    }
    
    printf("%d",ans);
    return 0;
}
​