L1-019 谁先倒

L1-019 谁先倒#includeiostream #includealgorithm #includevector using namespace std; int a1,b1,a2,b2,n; struct Node { int jhan; int jhua; int yhan; int yhua; }; int main() { cina1b1n; a20; b20; vectorNode hq(105); for(int i0;in;i) { cinhq[i].jhanhq[i].jhuahq[i].yhanhq[i].yhua; } for(int i0;in;i) { if((hq[i].jhuahq[i].jhanhq[i].yhan)(hq[i].yhuahq[i].jhanhq[i].yhan)) { continue; } if((hq[i].jhua!hq[i].jhanhq[i].yhan)(hq[i].yhua!hq[i].jhanhq[i].yhan)) { continue; } if(hq[i].jhuahq[i].jhanhq[i].yhan) { a2; } else if(hq[i].yhuahq[i].jhanhq[i].yhan) { b2; } if(a2a1) { coutA\nb2; break; } else if(b2b1) { coutB\na2; break; } } return 0; }