题解 | 小红的夹吃棋

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
char s[3][3];
int t;cin>>t;
for(int k=1;k<=t;k++)
{
	int kou=0,yu=0;
	for(int i=0;i<3;i++){
		for(int j=0;j<3;j++){
			cin>>s[i][j];
		}
	}
	for(int i=0;i<3;i++){
		if(s[i][0]=='*'&&s[i][2]=='*'&&s[i][1]=='o'){
			kou=1;
		}
	    if(s[i][0]=='o'&&s[i][2]=='o'&&s[i][1]=='*'){
			yu=1;
		}
	}
	for(int i=0;i<3;i++){
		if(s[0][i]=='*'&&s[2][i]=='*'&&s[1][i]=='o'){
			kou=1;
		}
		if(s[0][i]=='o'&&s[2][i]=='o'&&s[1][i]=='*'){
			yu=1;
		}
	}
	if(kou==yu){
		cout<<"draw"<<endl;
		kou=0,yu=0;
	}
	else if(kou>yu){
		cout<<"kou"<<endl;
		kou=0,yu=0;
	}
	else if(kou<yu){
		cout<<"yukari"<<endl;
		kou=0,yu=0;
	}
}
}