L1-019 谁先倒

L1-019 谁先倒

#include<iostream> #include<algorithm> #include<vector> using namespace std; int a1,b1,a2,b2,n; struct Node { int jhan; int jhua; int yhan; int yhua; }; int main() { cin>>a1>>b1>>n; a2=0; b2=0; vector<Node> hq(105); for(int i=0;i<n;++i) { cin>>hq[i].jhan>>hq[i].jhua>>hq[i].yhan>>hq[i].yhua; } for(int i=0;i<n;++i) { if((hq[i].jhua==hq[i].jhan+hq[i].yhan)&&(hq[i].yhua==hq[i].jhan+hq[i].yhan)) { continue; } if((hq[i].jhua!=hq[i].jhan+hq[i].yhan)&&(hq[i].yhua!=hq[i].jhan+hq[i].yhan)) { continue; } if(hq[i].jhua==hq[i].jhan+hq[i].yhan) { a2++; } else if(hq[i].yhua==hq[i].jhan+hq[i].yhan) { b2++; } if(a2>a1) { cout<<"A"<<"\n"<<b2; break; } else if(b2>b1) { cout<<"B"<<"\n"<<a2; break; } } return 0; }