浙大翁恺pat练习题,[L]B1018锤子剪刀布.cpp

# include

#include

#include

#include

#include

#include

using namespace std;

int change(char input) {

if(input == 'B') {

return 0;

} else if(input == 'C') {

return 1;

} else if(input == 'J') {

return 2;

}

}

int judge(int a , int b) {

if(a-b == -1 || a-b == 2) {

return 1;

} else if (a == b) {

return 0;

}

else {

return -1;

}

}

int main () {

int sum = 0;

cin>>sum;

int A,B;

int AWin = 0, /*APeace = 0,*/ ADefeat = 0;

int AQuan[3];

int BQuan[3];

memset(AQuan,0,sizeof(AQuan));

memset(BQuan,0,sizeof(BQuan));

for(int i = 0 ; i < sum ; ++i) {

char iA,iB;

cin>>iA>>iB;

A = change(iA);

B = change(iB);

if(judge(change(iA),change(iB)) == 1) {

AWin++;

if(A == 'B') {

AQuan[0]++;

} else if(A == 'C') {

AQuan[1]++;

} else if(A == 'J') {

AQuan[2]++;

}

}

else if(judge(change(iA),change(iB)) == -1) {

ADefeat++;

if(iB == 'B') {

BQuan[0]++;

} else if(iB == 'C') {

BQuan[1]++;

} else if(iB == 'J') {

BQuan[2]++;

}

}

}

int AMax = 0,BMax = 0;

for(int i = 1 ; i < 3 ; ++i) {

if(AQuan[i] > AQuan[AMax]) {

AMax = i;

}

if(BQuan[i] > BQuan[BMax]) {

BMax = i;

}

}

cout<

cout<

if(AMax == 0) {

cout<

} else if(AMax == 1) {

cout<

} else if(AMax == 2) {

cout<

}

if(BMax == 0) {

cout<

} else if(BMax == 1) {

cout<

} else if(BMax == 2) {

cout<

}

//cout<

//for(int i = 0 ; i < 3 ; ++i) {

//cout<

//}

//cout<

//for(int i = 0 ; i < 3 ; ++i) {

//cout<

//}

return 0;

}

一键复制

编辑

Web IDE

原始数据

按行查看

历史