题解 | #井字棋#

想了半天没想出来特殊算法，开摆

#include<stdio.h>

int main()
{
	int arr[9] = { 0 };
	char n = '0';
	char input = '0';
		for (int i = 0; i < 9; i++)
		{
			n = getchar();
			if('K' == n)
				arr[i] = 1;
			else if ('B' == n)
				arr[i] = -1;
			else
				arr[i] = 0;
				getchar();
		}
		if (arr[0] + arr[1] + arr[2] == 3 || arr[3] + arr[4] + arr[5] == 3
			|| arr[6] + arr[7] + arr[8] == 3 || arr[0] + arr[3] + arr[6] == 3
			|| arr[1] + arr[4] + arr[7] == 3 || arr[2] + arr[5] + arr[8] == 3
			|| arr[0] + arr[4] + arr[8] == 3 || arr[2] + arr[4] + arr[6] == 3)
			printf("KiKi wins!\n");
		else if (arr[0] + arr[1] + arr[2] == -3 || arr[3] + arr[4] + arr[5] == -3
			|| arr[6] + arr[7] + arr[8] == -3 || arr[0] + arr[3] + arr[6] == -3
			|| arr[1] + arr[4] + arr[7] == -3 || arr[2] + arr[5] + arr[8] == -3
			|| arr[0] + arr[4] + arr[8] == -3 || arr[2] + arr[4] + arr[6] == -3)
			printf("BoBo wins!\n");
		else
			printf("No winner!\n");
	return 0;
}