Code:
#include <iostream> #include <cstdio> #include <cstring>using namespace Std;char hash[3][3];int ans[3 ];int Main () {int n,i,j;for (i=0;i<3;i++) {hash[i][i]=1;} hash[0][1]=0;//Jia Sheng hash[0][2]=2; hash[1][0]=2; hash[1][2]=0; hash[2][0]=0; Hash[2][1]=2;while (scanf ("%d", &n) ==1) {GetChar (); Memset (ans,0,sizeof (ans)); int X[3]={0};int l[3]={0};for (i=0; i<n;i++) {char c1,c2;int a,b;scanf ("%c%*c%c%*c", &C1,&C2), if (c1== ' C ') a=0;if (c1== ' J ') a=1;if (c1== ' B ') a=2; if (c2== ' C ') b=0;if (c2== ' J ') b=1;if (c2== ' B ') b=2;ans[hash[a][b]]++;if (hash[a][b]==0) {if (a==0) x[0]++;if (a==1) x[1]++ ; if (a==2) x[2]++;} if (hash[a][b]==2) {if (b==0) l[0]++;if (b==1) l[1]++;if (b==2) l[2]++;}} for (i=0;i<3;i++) {if (i==2) printf ("%d\n", Ans[i]); elseprintf ("%d", Ans[i]);} for (i=2;i>=0;i--) {if (i==0) printf ("%d\n", Ans[i]); elseprintf ("%d", Ans[i]);} int Max=-1;for (i=0;i<3;i++) {if (X[i]>max) {max=x[i];j=i;}} if (j==0) {if (X[2]<max) printf ("C"); elseprintf ("B");} if (j==1) {if (X[2]==max) printf ("B"); else if (X[0]==max) printf ("C"); ElseprinTF ("J");} if (j==2) printf ("B"); Max=-1;for (i=0;i<3;i++) {if (L[i]>max) {max=l[i];j=i;}} if (j==0) {if (L[2]<max) printf ("c\n"); elseprintf ("b\n");} if (j==1) {if (L[2]==max) printf ("b\n"), else if (L[0]==max) printf ("c\n"); elseprintf ("j\n");} if (j==2) printf ("b\n");} return 0;}
Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.
Pat (B) 1018. Hammer and scissors cloth