题解 | #井字棋#纯暴力解法
井字棋
https://www.nowcoder.com/practice/0375c1d206ef48a3894f72aa07b2fdde
#include <iostream>
using namespace std;
int main() {
char a[4][4]={'p'};
int flag=0;
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
cin>>a[i][j];
}
}
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
if(a[i][j]=='K'){
if(a[i][j+1]=='K'){
if(a[i][j+2]=='K'){
cout<<"KiKi wins!";
flag=1;
break;
}
}
if(a[i+1][j]=='K'){
if(a[i+2][j]=='K'){
cout<<"KiKi wins!";flag=1;
break;
}
}
if(a[i+1][j+1]=='K'){
if(a[i+2][j+2]=='K'){
cout<<"KiKi wins!";flag=1;
break;
}
}
if(a[i+1][j-1]=='K'){
if(a[i+2][j-2]=='K'){
cout<<"KiKi wins!";flag=1;
break;
}
}
}
if(a[i][j]=='B'){
if(a[i][j+1]=='B'){
if(a[i][j+2]=='B'){
cout<<"BoBo wins!";flag=1;
break;
}
}
if(a[i+1][j]=='B'){
if(a[i+2][j]=='B'){
cout<<"BoBo wins!";flag=1;
break;
}
}
if(a[i+1][j+1]=='B'){
if(a[i+2][j+2]=='B'){
cout<<"BoBo wins!";flag=1;
break;
}
}
if(a[i+1][j-1]=='B'){
if(a[i+2][j-2]=='B'){
cout<<"BoBo wins!";flag=1;
break;
}
}
}
}
}
if(flag==0){
cout<<"No winner!";
}
}
// 64 位输出请用 printf("%lld")
查看16道真题和解析