-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path4047.cpp
120 lines (117 loc) · 1.56 KB
/
4047.cpp
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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
// 4047. 영준이의 카드 카운팅
// 2019.07.01
#include<iostream>
#include<string>
using namespace std;
int s[14];
int d[14];
int h[14];
int c[14];
int sCnt;
int dCnt;
int hCnt;
int cCnt;
void cal()
{
for (int i = 1; i <= 13; i++)
{
if (s[i] == 1)
{
sCnt++;
}
if (c[i] == 1)
{
cCnt++;
}
if (h[i] == 1)
{
hCnt++;
}
if (d[i] == 1)
{
dCnt++;
}
}
}
int main()
{
int test_case;
int T;
cin >> T;
for (test_case = 1; test_case <= T; ++test_case)
{
fill(s, s + 14, 0);
fill(d, d + 14, 0);
fill(h, h + 14, 0);
fill(c, c + 14, 0);
sCnt = 0;
dCnt = 0;
hCnt = 0;
cCnt = 0;
string str;
cin >> str;
bool flag = true;
for (int i = 0; i < str.size(); i += 3)
{
string tmp = str.substr(i, 3);
int k = 0;
switch (tmp[0])
{
case 'S':
k = stoi(tmp.substr(1, 2));
if (s[k] == 1)
{
flag = false;
}
else
{
s[k]++;
}
break;
case 'D':
k = stoi(tmp.substr(1, 2));
if (d[k] == 1)
{
flag = false;
}
else
{
d[k]++;
}
break;
case 'H':
k = stoi(tmp.substr(1, 2));
if (h[k] == 1)
{
flag = false;
}
else
{
h[k]++;
}
break;
case 'C':
k = stoi(tmp.substr(1, 2));
if (c[k] == 1)
{
flag = false;
}
else
{
c[k]++;
}
break;
}
}
cal();
if (flag)
{
cout << "#" << test_case << " " << 13 - sCnt << " " << 13 - dCnt << " " << 13 - hCnt << " " << 13 - cCnt << endl;
}
else
{
cout << "#" << test_case << " " << "ERROR" << endl;
}
}
return 0;
}