MSBOP 2015 Round2B register

Ended

Participants:6187

Verdict:AC | TLE
Submitted:2015-04-26 14:49:03

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include <cstdio>
using namespace std;
//const int NMAX=10000;
const char CH[13]={'2','3','4','5','6','7','8','9','T','J','Q','K','A'};
char r[58]={0};
int count[128];
int s[5];
int place[100];
int C;
unsigned long long A;
int n;
void input()
{
    scanf("%d",&n);
    char c;
    for (int i=0;i<13;i++)
        count[CH[i]]=0;
    for (int i=0;i<n;i++)
    {
        scanf("%c",&c);
        scanf("%c",&c);
        count[c]++;
        r[i]=c;
        place[i+1]=0;
        scanf("%c",&c);
    }
    //for (int i=0;i<13;i++)
    //    printf("\n%c:%d ",CH[i],count[CH[i]]);
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX