pat_b_1018 锤子剪刀布

    http://pat.zju.edu.cn/contests/pat-b-practise/1018
    分析： pat level basic的题，不解释。。。

    代码：

            #include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
using namespace std;

char a,b;
struct node
{
int wc,pc,lc;
int bc,cc,jc;
}pa,pb;

void judge()
{
if(a=='J'){
if(b=='C') {pa.lc++; pb.wc++; pb.cc++;}
if(b=='B') {pa.wc++; pb.lc++; pa.jc++;}
if(b=='J') {pa.pc++; pb.pc++;}
}
if(a=='B'){
if(b=='J') {pa.lc++; pb.wc++; pb.jc++;}
if(b=='C') {pa.wc++; pb.lc++; pa.bc++;}
if(b=='B') {pa.pc++; pb.pc++;}
}
if(a=='C'){
if(b=='B') {pa.lc++; pb.wc++; pb.bc++;}
if(b=='J') {pa.wc++; pb.lc++; pa.cc++;}
if(b=='C') {pa.pc++; pb.pc++;}
}
}

int mymax(int x,int y,int z)
{
int tmp= (x<y? y:x);
return tmp <z? z:tmp;
}

void mysort()
{
int amax=mymax(pa.bc,pa.cc,pa.jc);
int bmax=mymax(pb.bc,pb.cc,pb.jc);
if(amax>pa.bc){
if(amax>pa.cc){
printf("J ");
}
else printf("C ");
}
else printf("B ");

if(bmax>pb.bc){
if(bmax>pb.cc){
printf("J\n");
}
else printf("C\n");
}
else printf("B\n");
}

int main()
{
//freopen("in.txt","r",stdin);
int n;
scanf("%d",&n); getchar();
pa.wc=pa.pc=pa.lc=0;
pa.bc=pa.cc=pa.jc=0;
pb=pa;
while(n--){
cin>>a>>b;
judge();
}
printf("%d %d %d\n",pa.wc,pa.pc,pa.lc);
printf("%d %d %d\n",pb.wc,pb.pc,pb.lc);
mysort();
return 0;
}
写麻烦了。。。