Pro.ID21726 TitleLETTERS Title链接http://10.20.2.8/oj/exercise/problem?problem_id=21726 AC2 Submit2 Ratio100.00% 时间&空间限制描述"The quick brown fox jumped over the lazy dogs." This sentence is well known for containing at least one of every letter of the alphabet. We could say, then, that it contains 26 different letters. In this problem you are given a series of pieces of text. In each case, state how many different letters the text contains. Spaces, digits and punctuation are ignored. Upper case letters are not distinguished from their lower case counterparts, so 'A' and 'a' just count as one letter. 输入Input consists of a series of lines of text, each one no more than 250 characters long. Each piece of text will contain at least one non-white space character, but not necessarily a letter. The last line will contain just # - this line should not be processed. 输出Description "The quick brown fox jumped over the lazy dogs." This sentence is well known for containing at least one of every letter of the alphabet. We could say, then, that it contains 26 different letters. In this problem you are given a series of pieces of text. In each case, state how many different letters the text contains. Spaces, digits and punctuation are ignored. Upper case letters are not distinguished from their lower case counterparts, so 'A' and 'a' just count as one letter. Input Input consists of a series of lines of text, each one no more than 250 characters long. Each piece of text will contain at least one non-white space character, but not necessarily a letter. The last line will contain just # - this line should not be processed. Output Output will consists of a single integer for each line of input, each integer on a line by itself. The integer will be the number of different letters found in the text. Sample Input The quick brown fox jumped over the lazy dogs. Sample Output 26 Source 样例输入The quick brown fox jumped over the lazy dogs. 样例输出26 作者 |