| Submit | All submissions | Best solutions | Back to list |
RIOI_0_2 - Unique strings |
You are given N strings, you have to determine how many of them are unique. Unique means that it appears in the input for that test case only once.
Constraints
N <= 100000
sum of all lengths of strings <= 2*10^6.
Input
First line of input is number t, the number of test cases. Next line consists of integer N. N lines follow each containing one string.
Output
Output asked number for each test case.
Example
Input: 1 10 aba asdf abbe aba abbe aaaa aaaa abbe aaaa bbbb Output: 2
Explanation
"bbbb" and "asdf" are only two strings that are unique in the input.
| Added by: | Buda IM |
| Date: | 2012-10-12 |
| Time limit: | 0.100s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM64 |
| Resource: | Own problem |
hide comments
|
2013-06-05 15:11:35 Bryan Poulsen
For clarification should the output be a number totaling all test cases, or should there be a new number on each line for each test case? |
RSS