签个到吧codeforces898

#include
#define int long long 
#define endl "\n"
#define IOS std::ios::sync_with_stdio;cin.tie(0);cout.tie(0);
using namespace std;
int n;
void solve(){
    cin >> n;
    while(n--){
        string s;
        cin >> s;
        int s1=s.find('a');
        int s2=s.find('b');
        int s3=s.find('c');
        if(s1==0||s2==1||s3==2){
            cout << "YES" << endl;
        }
        else cout << "NO" <
    }
}
signed main(){
    IOS;int _=1; //cin >> _;
    while(_--){
        solve();
    }
    return 0;
}

b。

#include
#define int long long 
#define endl "\n"
#define IOS std::ios::sync_with_stdio;cin.tie(0);cout.tie(0);
using namespace std;
int n;
void solve(){
    cin >> n;
    while(n--){
        int k; cin >> k;
        map<int ,int>mp;//防止重复
        int a[k],minn=10,sum=1;
        memset(a,0,sizeof(a));
        //memset(mp,0,sizeof(mp));
        for(int i=0;i
            cin >> a[i];
            if(a[i]
            	minn=a[i];
            	mp[i]=1;
			}
            
        }
        for(int i=0;i
            if(minn==a[i]&&mp[i]==1){
                a[i]+=1;
            }
            sum*=a[i];
        }
        cout << sum << endl ;
    }
}
signed main(){
    IOS;int _=1; //cin >> _;
    while(_--){
        solve();
    }
    return 0;
}

c

#include 
using namespace std;
#define ll long long
#define sz(c) (int)c.size()
#define all(c) c.begin(),c.end()
#define f first
#define s second
 
void solve() {
	vector s(10);
	for (string& i : s)
		cin >> i;
 
	ll out = 0;
	for (ll i = 0; i < 10; i++)
		for (ll j = 0; j < 10; j++)
			if (s[i][j] == 'X')
				out += min({i+1,10-i,j+1,10-j});
 
	cout << out << "\n";
}
 
int main(void) {
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int t;
	cin >> t;
	for (int i = 1; i <= t; ++i)
		solve();
}