wip

38. Pokedex Count

Time Limit: 1 seconds

Memory Limit: 128 MB

Rating: 900

You are given a list of pokemon caught, the issue is some of them are duplicates which don’t need to be counted towards the number of unique pokemon caught. You are first given an integer $n$, the number of Pokemons. You are then given the list of Pokemons. Determine the number of unique Pokemons.

On the first line, you are given integer $n$. $(1 \le n \le 100)$ The next $n$ lines each contain a name of a Pokemon as a string.

Output the answer described in the Problem Statement.

Sample Input 1:
4
Pikachu
Charizard
Charmander
Pikachu

Sample Output 1:
3

Returns 3 as pikachu appears twice. *Note: there can be multiple pokemons which appear more than once.

KL Coding Cup March 2023 > Pokemon > Problem 2