思维训练代码

A

#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(int argc, char const *argv[]) {
	int t;
    cin>>t;
    while(t--){
        int n,a[110];
        cin>>n;
        int maxn=0;
        for(int i=0;i<n;i++) {
            cin>>a[i];
            maxn=max(a[i],maxn);
        }
        char c[55];
        memset(c,0,sizeof(c));
        for(int i=0;i<=maxn;i++){
            c[i]='a';
        }
        cout<<c<<endl;
        for(int i=0;i<n;i++){
        ///    cout<<a[i]<<endl;
            if(c[a[i]]=='a') c[a[i]]='b';
            else c[a[i]]='a';
            cout<<c<<endl;
        }
    }
	return 0;
}

B

#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(int argc, char const *argv[]) {
	int t;
    cin>>t;
    while(t--){
        int n,a[110];
        cin>>n;
        for(int i=1;i<=n;i++) {
            cin>>a[i];
            if(a[i]<0) a[i]*=-1;
        }
        int f=1;
        for(int i=1;i<=n;i++){
            cout<<a[i]*f<<" ";
            f*=-1;
        }cout<<endl;
    }
	return 0;
}

C

#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(int argc, char const *argv[]) {
	int t;
    cin>>t;
    while(t--){
        int n;
        char c[55];
        cin>>n>>c+1;
        queue<char> q;
        while(!q.empty()) q.pop();
        for(int i=1;i<=n;i++){
            if(c[i]=='(') q.push('(');
            else {
                if(!q.empty())
                    q.pop();
            }
        }
        cout<<q.size()<<endl;
    }
	return 0;
}

D

#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(int argc, char const *argv[]) {
	int t;
    cin>>t;
    while(t--){
        int n,m,a[55][55];
        cin>>n>>m;
        int cntl=0,cntr=0;
        for(int i=1;i<=n;i++){
            int f=0;
            for(int j=1;j<=m;j++){
                cin>>a[i][j];
                if(a[i][j]==1)
                    f=1;
            }
            if(f) cntl++;
        }
        for(int i=1;i<=m;i++){
            int f=0;
            for(int j=1;j<=n;j++){
                if(a[j][i]==1)
                    f=1;
            }
            if(f) cntr++;
        }
        cntl=n-cntl;
        cntr=m-cntr;
        //cout<<cntl<<endl;
        cntl=min(cntr,cntl);
        //cout<<"   "<<cntl<<endl;
        if(cntl%2==0) cout<<"Vivek"<<endl;
        else cout<<"Ashish"<<endl;
    }
	return 0;
}

E

#include<bits/stdc++.h>
using namespace std;
#define ll long long

void solve(){
    int n,a[100010],af1[100010],az1[100010],b[100010];
    cin>>n;
    int f1=0,z1=0;
    memset(af1,0,sizeof(af1));
    memset(az1,0,sizeof(az1));
    for(int i=1;i<=n;i++){
        int x;cin>>x;a[i]=x;
        if(x==-1) af1[i]=++f1,az1[i]=z1;
        else if(x==1) af1[i]=f1,az1[i]=++z1;
        else af1[i]=f1,az1[i]=z1;
    }
    // cout<<endl;
    // for(int i=1;i<=n;i++) cout<<af1[i]<<" ";cout<<endl;
    // for(int i=1;i<=n;i++) cout<<az1[i]<<" ";cout<<endl;
    // cout<<endl;
    for(int i=1;i<=n;i++) cin>>b[i];
    for(int i=n;i>0;i--){
        if(b[i]!=a[i]){
            if(b[i]>a[i]&&az1[i-1]==0){
                cout<<"NO"<<endl;
                return ;
            }
            if(b[i]<a[i]&&af1[i-1]==0){
                cout<<"NO"<<endl;
                return ;
            }
        }
    }
    cout<<"YES"<<endl;
}
int main() {
    int t;
    cin>>t;
    while(t--) solve();
    return 0;
}

F

#include<bits/stdc++.h>
using namespace std;
#define ll long long

int main() {
    int t;
    cin>>t;
    while(t--){
        int n,a[110];
        cin>>n;
        for(int i=1;i<=n;i++) cin>>a[i];
        sort(a+1,a+1+n);
        for(int i=n;i>0;i--) cout<<a[i]<<" ";cout<<endl;
    }
}

G

#include<bits/stdc++.h>
using namespace std;
#define ll long long

void solve(){
    string s1,s2;
    int a[30],b[30];
    for(int i=1;i<=26;i++) a[i]=0;
    for(int i=1;i<=26;i++) b[i]=0;
    cin>>s1;
    cin>>s2;
    int len1=s1.size(),len2=s2.size();
    for(int i=0;i<len1;i++){
        a[s1[i]-'a'+1]++;
    }
    //for(int i=0;i<26;i++) cout<<a[i];cout<<endl;
    for(int i=0;i<len2;i++){
        for(int i=1;i<=26;i++) b[i]=0;
        for(int j=i;j<len1+i&&j<len2;j++){
            b[s2[j]-'a'+1]++;
        }
        //for(int j=0;j<26;j++) cout<<b[i]<<" ";
        int f=1;
        for(int j=1;j<=26;j++){
            if(a[j]!=b[j]){
                //cout<<"das";
                f=0;
                break;
            }
        }
        if(f){
            cout<<"YES"<<endl;
            return ;
        }
    }
    cout<<"NO"<<endl;
}
int main() {
    int t;
    cin>>t;
    while(t--){
        solve();
    }
}

H

#include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve(){
    ll a,b;
    cin>>a>>b;
    if(a>b) swap(a,b);
    ll c=b-a;
    ll sum=0;
    for(int i=1;i<=1000000000;i++){
        sum=i*(i-1)/2;
        if(sum>=c){
            if((a+b+sum)%2==0){
                cout<<i-1<<endl;
                return;
            }
        }
    }
}
int main() {
    int t;
    cin>>t;
    while(t--){
        solve();
    }
}

I

#include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve(){
    int a,b,c;
    cin>>a>>b>>c;
    if(a<b) swap(a,b);
    if(b<c) swap(b,c);
    if(a<b) swap(a,b);
    ll ans=0;
    if(a-b>=c) cout<<c+b<<endl;
    else{
        ans+=a-b;
        c-=(a-b);
        a=b;
        if(c%2==0) {
            ans+=c;
            a-=c/2,b-=c/2;
            ans+=a;
        }
        else {
            ans+=c;
            a-=c/2;a--;
            ans+=a;
        }
        cout<<ans<<endl;
    }
}
int main() {
    int t;
    cin>>t;
    while(t--){
        solve();
    }
}