CodeForces 443A Anton and Letters

最新推荐文章于 2021-02-14 19:18:06 发布

原创最新推荐文章于 2021-02-14 19:18:06 发布 · 901 阅读

0 ·

CC 4.0 BY-SA版权

AC路漫漫专栏收录该内容

180 篇文章

订阅专栏

本博客介绍了一种方法，用于计算给定集合中所有不重复的小写字母的数量，通过读取输入字符串并使用数组来跟踪每个字母的出现情况。

Recently, Anton has found a set. The set consists of small English letters. Anton carefully wrote out all the letters from the set in one line, separated by a comma. He also added an opening curved bracket at the beginning of the line and a closing curved bracket at the end of the line.

Unfortunately, from time to time Anton would forget writing some letter and write it again. He asks you to count the total number of distinct letters in his set.

Input

The first and the single line contains the set of letters. The length of the line doesn't exceed 1000. It is guaranteed that the line starts from an opening curved bracket and ends with a closing curved bracket. Between them, small English letters are listed, separated by a comma. Each comma is followed by a space.

Output

Print a single number — the number of distinct letters in Anton's set.

Sample test(s)

Input

{a, b, c}

Output

Input

{b, a, b, a}

Output

Input

{}

Output

0

#include<cstring>
#include<cstdio>
#include<iostream>
using namespace std;
int num[25];
char s[1100];
int main(){
    int n,len,sum,i;
    while(gets(s)){
        sum=0;
        memset(num,0,sizeof(num));
        len=strlen(s);
        for(i=0;i<len;i++){
            if(s[i]>='a'&&s[i]<='z'){
                num[s[i]-'a']=1;
            }
        }
        for(i=0;i<=25;i++){
            if(num[i]==1){
                sum++;
            }
        }
        cout<<sum<<endl;
    }
    return 0;
}