codeforces 443A-Anton and Letters(set)

A. Anton and Letters
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.

Examples
input
{a, b, c}
output
3
input
{b, a, b, a}
output
2
input
{}
output
0
链接：https://codeforces.ml/problemset/problem/443/A
题意：不重复的字母个数
思路：set可以来计算不重复的char个数
ac代码如下：

#include<iostream>
#include<string>
#include<set>
#include<cstring>
using namespace std;
int main(){
	char st[1002];
	set<char> se;
	
	gets(st);//另一种读入的方法：scanf("%[^\n]s",st);
	
	for(int i=0;i<strlen(st);i++)
	{
		
		if(st[i]>='a'&& st[i]<='z')
		{
			if(se.find(st[i])==se.end())
			{
				se.insert(st[i]);
			}
		}
	}
	cout<<se.size()<<endl;
}