题解 | 小红的夹吃棋

#include <stdio.h>
char Iswin(char (*p)[3])
{
	char h = 0;
	char z = 0;
	for (int i = 0; i < 3; i++)
	{
		scanf("%s", *(p + i));
	}
	for (int i = 0; i < 3; i++)
	{
		if (p[i][0] == p[i][2] && p[i][0] != p[i][1] && p[i][1] != '.')
		{
			if (p[i][0] == 'o')
				z++;
			else if (p[i][0] == '*')
				h++;
		}
		if (p[0][i] == p[2][i] && p[0][i] != p[1][i] && p[1][i] != '.')
		{
			if(p[0][i] == 'o')
				z++;
		    else if (p[0][i] == '*')
			    h++;
		}
	}
	if (h == z || h > 0 && z > 0)
		return 'p';
	return h ? 'h' : 'z';
} 
int main() {
	int n = 0;
	char arr[3][3];
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
	{
		switch (Iswin(arr))
		{
		case 'h':
			printf("kou\n");
			break;
		case 'z':
			printf("yukari\n");
			break;
		case 'p':
			printf("draw\n");
			break;
		}
	}
	return 0;
}