﻿ Ningbo University of Technology Online Judge :: [1161] Card Game Cheater
• ### [1161] Card Game Cheater

• 时间限制: 1000 ms　内存限制: 65535 K
• 问题描述
• 输入
• There will be several test cases. The first line of input will contain a single positive integer N giving the number of test cases. After that line follow the test cases. Each test case starts with a line with a single positive integer k <= 26 which is the number of cards each player gets. The next line describes the k cards Adam has placed on the table, left to right. The next line describes the k cards Eve has (but she has not yet placed them on the table). A card is described by two characters, the first one being its value (2, 3, 4, 5, 6, 7, 8 ,9, T, J, Q, K, or A), and the second one being its suit (C, D, S, or H). Cards are separated by white spaces. So if Adam's cards are the ten of clubs, the two of hearts, and the Jack of diamonds, that could be described by the line TC 2H JD
• 输出
• For each test case output a single line with the number of points Eve gets if she picks the optimal way to arrange her cards on the table.
• 样例输入
• 3
1
JD
JH
2
5D TC
4C 5H
3
2H 3H 4H
2D 3D 4D

• 样例输出
• 1
1
2

• 提示
• 来源
• ZJGSU
• 操作
﻿