Educational Codeforces Round 68 (Rated for Div. 2)

Educational Codeforces Round 68 (Rated for Div. 2)

A

# include <bits/stdc++.h>
using namespace std;
​
typedef long long LL;
int main()
{
    int T;
    scanf("%d",&T);
    
    while(T--){
        LL n,x;
        scanf("%lld %lld",&n,&x);
        printf("%lld\n",x*2);
        
    }
    
    return 0;
}
​

B

# include <bits/stdc++.h>
using namespace std;
​
const int MAXN=5e4+100;
string p[MAXN];
int a[MAXN];
int b[MAXN];
int main()
{
    int T;
    
    scanf("%d",&T);
    while(T--){
        int n,m;
        scanf("%d %d",&n,&m);
        int ans=1e6;
        
        for(int i=0;i<max(n,m);i++){
            a[i]=0;
            b[i]=0;
        }
        
        
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                char c;
                scanf("%c",&c);
                cout<<c<<endl;
                p[i][j]=c;
                if(p[i][j]=='*'){
                    a[i]++;
                    b[j]++;
                }
            }
        }
        
        
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                int d=0;
                d=(n-a[i])+(m-b[j]);
                if(p[i][j]=='.') d--;
                ans=min(ans,d);
            }
        }
        printf("%d\n",ans);
    }
    
    return 0;
}
​

C

# include <bits/stdc++.h>
using namespace std;
​
int ss[30];
int tt[30];
int qq[30];
int main()
{
    int T;
    
    scanf("%d",&T);
    while(T--){
        int flag1=1;
        int flag2=1;
        for(int i=0;i<30;i++){
            ss[i]=0;
            tt[i]=0;
            qq[i]=0;
        }
        string s,t,q;
        cin>>s;
        cin>>t;
        cin>>q;
        for(int i=0;i<s.length();i++){
            ss[s[i]-'a']++;
        }
        for(int i=0;i<t.length();i++){
            tt[t[i]-'a']++;
        }
        for(int i=0;i<q.length();i++){
            qq[q[i]-'a']++;
        }
        
        int ll=0,rr=0;
        while(ll<t.length()&&rr<s.length()){
            if(s[rr]==t[ll]) rr++,ll++;
            else ll++;
        }
        if(rr>=s.length()) flag1=1;
        else flag1=0;
        
        //cout<<flag1<<" "<<flag2<<endl;
        for(int i=0;i<26;i++){
            int a=tt[i]-ss[i];
            if(qq[i]<a){
                flag2=0;
                break;
            }
        }
        
        if(flag1&&flag2){
            printf("YES\n");
        }else{
            printf("NO\n");
        }
        
    }
    
    return 0;
}
​