| Submit | All submissions | Best solutions | Back to list |
NOVICE22 - Problem 2 |
Character set of a text is the set of all the characters which are used at least once in the text. you are given an string of at most 200000 characters which contains only ASCII characters except whitespaces. you have to find the length of its character set.
Input
First line contains T the number of test cases. Each of next T lines contains an string S of at least 1 and at most 200000 characters.
Output
For each test case print the answer in a new line.
Example
Input:
2
abA
contact@nsit_programming_group
Output: 3
14
| Added by: | Mahesh Chandra Sharma |
| Date: | 2011-01-25 |
| Time limit: | 0.5s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM64 |
| Resource: | NSIT Noivce contest #2 |
hide comments
|
2020-09-13 01:12:30
how the second test case shows only 14 , it must be 30?!! |
|
|
2014-03-01 15:51:36 Abhishek Vijjapu
tle :'( Time Complexity ? |
|
|
2013-05-30 10:06:13 Unnati Gupta
how come the second test case shows the answer 14 |
|
|
2011-04-07 00:30:00 LeppyR64
"at most 100000 characters." This is false. Using 1000000 will work. Edit: Fixed :) Last edit: 2011-04-07 00:30:43 |
RSS