/gheorghem  tudor vianu

/junior cpp

 

 

 

#include<stdio.h>

#include<string.h>

long sum=0;

int v[10][20];

 

 

int min(int a, int b, int c, int d)

{

if(b<a)

            a=b;

if(c<a)

            a=c;

if(d<a)

            a=d;

return a;

}

 

 

void rez()

{

int mina,mink,minq,minj;

mina=min(v[1][1],v[2][1],v[3][1],v[4][1]);

mink=min(v[1][2],v[2][2],v[3][2],v[4][2]);

minq=min(v[1][3],v[2][3],v[3][3],v[4][3]);

minj=min(v[1][4],v[2][4],v[3][4],v[4][4]);

if(mina==1)

            sum=sum+10;

else

            if(mina==2)

                        sum=sum+120;

 

if(mink==1)

            sum=sum+8;

else

            if(mink==2)

                        sum=sum+96;

 

if(minq==1)

            sum=sum+6;

else

            if(minq==2)

                        sum=sum+72;

 

if(minj==1)

            sum=sum+4;

else

            if(minj==2)

                        sum=sum+48;

 

if(v[1][4]==2 && v[3][3]==2)

            sum=sum+38;

else

            if(v[1][4]>=1 && v[3][3]>=1)

                        sum=sum+4;

}

// v[1]=diamonds

// v[2]=clubs

// v[3]=spades

// v[4]=hearts

 

 

void read()

{

freopen("date.in","r",stdin);

freopen("date.out","w",stdout);

 

int j,k,i;

char s[20];

char ch1,ch2,ch3;

for(j=1;j<=5;j++)

            {

            scanf("%c%c%c",&ch1,&ch2,&ch3);

            gets(s);

            s[strlen(s)]='\n';

            s[strlen(s)+1]=NULL;

            memset(v,0,sizeof(v));

            i=0;

            sum=0;

            for(k=1;k<=3;k++)

                        {

                        while(s[i]!=',')

                                    {

                                    if(s[i]=='A')

                                                v[k][1]++;

                                    if(s[i]=='K')

                                                v[k][2]++;

                                    if(s[i]=='Q')

                                                v[k][3]++;

                                    if(s[i]=='J')

                                                v[k][4]++;

                                    i++;

                                    }

                        i=i+2;

                        }

            while(s[i]!='\n')

                        {

                        if(s[i]=='A')

                                    v[4][1]++;

                        if(s[i]=='K')

                                    v[4][2]++;

                        if(s[i]=='Q')

                                    v[4][3]++;

                        if(s[i]=='J')

                                    v[4][4]++;

                        i++;

                        }

            rez();

            printf("%d. %ld\n",j,sum);

            }

}

 

 

int main()

{

read();

return 0;

}