eolymp
bolt
Try our new interface for solving problems
Problems

I’ve Been Everywhere, Man

I’ve Been Everywhere, Man

Alice travels a lot for her work. Each time she travels, she visits a single city before returning home. Someone recently asked her "how many different cities have you visited for work?" Thankfully Alice has kept a log of her trips. Help Alice figure out the number of cities she has visited at least once. \InputFile The first line contains a single positive integer $t~(t \le 50)$ indicating the number of test cases. The first line of each test case also contains a single positive integer $n$ indicating the number of work trips Alice has taken so far. The following $n$ lines describe these trips. The $i$-th such line simply contains the name of the city Alice visited on her $i$-th trip. Alice's work only sends her to cities with simple names: city names only contain lowercase letters, have at least one letter, and do not contain spaces. The number of trips is at most $100$ and no city name contains more than $20$ characters. \OutputFile For each test case, simply output a single line containing a single integer that is the number of distinct cities that Alice has visited on her work trips.
Time limit 1 second
Memory limit 128 MiB
Input example #1
2
7
saskatoon
toronto
winnipeg
toronto
vancouver
saskatoon
toronto
3
edmonton
edmonton
edmonton
Output example #1
4
1
Source 2015 ACM North America - Rocky Mountain, Problem J