|
|||
Judging TroublesThe NWERC organisers have decided that they want to improve the automatic grading of the submissions for the contest, so they now use two systems: DOMjudge and Kattis. Each submission is judged by both systems and the grading results are compared to make sure that the systems agree. However, something went wrong in setting up the connection between the systems, and now the jury only knows all results of both systems, but not which result belongs to which submission! You are therefore asked to help them figure out how many results could have been consistent. Input SpecificationThe input consists of:
Each result is a string of length between 5 and 15 characters (inclusive) consisting of lowercase letters. Output SpecificationOutput one line with the maximum number of judging results that could have been the same for both systems. Sample Input
Output for Sample Input
Original Problem |
|||
University of Debrecen; Faculty of Informatics; v. 03/01/2019 |