CodeForces - 443A Anton and Letters （简单搜索）

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
问题链接：http://codeforces.com/problemset/problem/443/A
问题简述：判断输入的字符串有多少个不同的字母
问题分析：我发现直接cin>>char数组总是会出现问题，所以最后换成逐个字符输入，遇到’}'停止。另外用一个数组存储已经出现的字符串（发现最多检查的循环次数为26*1000，感觉不会超时，于是用循环逐个检查是否已经出现过）
AC通过的C++语言程序如下：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include <algorithm>
#include<string.h>
#include<stdio.h>
using namespace std;
char p[1005] = { '\0' };
char m[30] = { '\0' };
int main()
{
	int chang = 0;
	for (int i = 0; p[i-1] != '}'; i++)
	{
		cin >> p[i];
		chang++;
	}
	int res = 0;
	for (int i = 1; i < chang; i++)
	{
		if (p[i] >= 97 && p[i] <= 122)
		{
			int flag = 0;
			for (int j = 0; j < res; j++)
			{
				if (p[i] == m[j]) { flag++; break; }
			}
			if (flag == 0) 
			{
				m[res] = p[i];
				res++;
			}
		}
	}
	cout << res;
	return 0;
}