蒟蒻 80 pts 求条
查看原帖
蒟蒻 80 pts 求条
380639
dthythxth_Huge_Brain楼主2023/10/31 11:38
#include<bits/stdc++.h>
#define int long long
#define D(x) std::cerr<<#x<<'='<<x;
char a[11];
std::string qp[4][4];
int k;
signed main(){
	//freopen("bed.in","r",stdin);
	//freopen("bed.out","w",stdout);
	scanf("%s",a),k=strlen(a);
	for(int i=0;i<k;i++){
		if(i%2==0)qp[(a[i]-'1')/3+1][(a[i]-'0'+2)%3+1]="xiaoa wins.";
		else qp[(a[i]-'1')/3+1][(a[i]-'0'+2)%3+1]="uim wins.";
	}
	for(int i=1;i<=3;i++)if(qp[i][1]==qp[i][2]&&qp[i][1]==qp[1][3]){
		std::cout<<qp[1][i];
		return 0;
	}
	for(int i=1;i<=3;i++)if(qp[1][i]==qp[2][i]&&qp[1][i]==qp[1][i]){
		std::cout<<qp[1][i];
		return 0;
	}
	if(qp[1][1]==qp[2][2]&&qp[1][1]==qp[3][3]){
		std::cout<<qp[3][3];
		return 0;
	}
	if(qp[1][3]==qp[2][2]&&qp[2][2]==qp[3][1]){
		std::cout<<qp[2][2];
		return 0;
	}
	puts("drew.");	 
	return 0;
}

2023/10/31 11:38
加载中...