-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path07.c
90 lines (83 loc) · 1.24 KB
/
07.c
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
#include <stdio.h>
int main(int argc, char *argv[])
{
int num, cnt = 0, n = 0;
char c, dummy;
scanf("%d", &n);
scanf("%c", &dummy);
char cList[n];
int numList[n];
int S[13] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
int H[13] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
int C[13] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
int D[13] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
cnt = 0;
while (cnt < n)
{
// scanf("%c %d\n",&c ,&num);
scanf("%c",&c);
scanf("%d",&num);
scanf("%c", &dummy);
cList[cnt] = c;
numList[cnt] = num;
cnt++;
}
cnt = 0;
while (cnt < n)
{
if (cList[cnt] == 'S')
{
S[numList[cnt] - 1] = 1;
}
if (cList[cnt] == 'H')
{
H[numList[cnt] - 1] = 1;
}
if (cList[cnt] == 'C')
{
C[numList[cnt] - 1] = 1;
}
if (cList[cnt] == 'D')
{
D[numList[cnt] - 1] = 1;
}
cnt++;
}
cnt = 0;
while (cnt < 13)
{
if (S[cnt] == 0)
{
printf("S %d\n", cnt + 1);
}
cnt++;
}
cnt = 0;
while (cnt < 13)
{
if (H[cnt] == 0)
{
printf("H %d\n", cnt + 1);
}
cnt++;
}
cnt = 0;
while (cnt < 13)
{
if (C[cnt] == 0)
{
printf("C %d\n", cnt + 1);
}
cnt++;
}
cnt = 0;
while (cnt < 13)
{
if (D[cnt] == 0)
{
printf("D %d\n", cnt + 1);
}
cnt++;
}
return 0;
}