1018 锤子剪刀布

#include
using namespace std;
int main(){
	int a1=0,b1=0,c1=0,a2=0,b2=0,c2=0;
	int n;
	map<int,char>k;
	k[0]='B';k[1]='C';k[2]='J';
	cin>>n;
	int m1[3]={0};
	int m2[3]={0};
	for(int i=0;i//BCJ
		char a,b;
		cin>>a>>b;
		if(a=='C'){
			if(b=='C'){
				b1++;b2++;
			}else if(b=='J'){
				a1++;
				m1[1]++; 
				c2++;
			}else{
				a2++;
				m2[0]++;
				c1++;
			}
		}
		if(a=='J'){
			if(b=='C'){
				a2++;
				m2[1]++;
				c1++;
			}else if(b=='J'){
				b1++;b2++;
			}else{
				a1++;
				m1[2]++;
				c2++;
			}
		}
		if(a=='B'){
			if(b=='C'){
				a1++;
				m1[0]++;
				c2++; 
			}else if(b=='J'){
				a2++;
				m2[2]++;
				c1++;
			}else{
				b1++;b2++;
			}
		}
	}
	cout<" "<" "<
	cout<" "<" "<
	int max_i1=0,max_i2=0;
	int t1=m1[0],t2=m2[0];
	for(int i=0;i<3;i++){
		if(t1
			max_i1=i;
			t1=m1[i];
		}
		if(t2
			max_i2=i;
			t2=m2[i];
		}
	}
	
	cout<" "<
}