| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 2 초 | 512 MB | 203 | 121 | 102 | 66.667% |
Alice loves visiting Paris. Every time she is in the city, she tries to see as many monuments as she can, and every day of her visit she notes down in her travel notebook which monument she saw that day. After many years and many trips to Paris, Alice is wondering how many different monuments she saw in her combined visits. She shows you her travel notebook, and asks for your help in computing this number.
The input consists of n lines, all of which contain, first, a date (in the format YYYY-MM-DD), then a space, then the name of a monument. Names of monuments are character strings of arbitrary length and containing arbitrary printable characters except for the newline character.
The output should consist of a single line, whose content is an integer, the number m of distinct monuments in the input.
2016年12月30日 Tour Eiffel 2016年12月31日 Tour Saint-Jacques 2016年12月31日 Centre Georges Pompidou 2018年01月15日 Tour Eiffel 2018年01月15日 Invalides 2018年01月15日 Arc de Triomphe 2018年01月16日 Tour Saint-Jacques 2018年01月16日 Panthéon 2018年01月17日 Sacré Cœur
7
ICPC > Regionals > Europe > Southwestern European Regional Contest > SWERC 2018 연습 세션 PE번