cf443A Anton and Letters

最新推荐文章于 2021-08-26 05:08:53 发布

转载最新推荐文章于 2021-08-26 05:08:53 发布 · 140 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/zhber/p/4035962.html

本文介绍了一个简单的编程问题：从重复的字母集合中计算并输出唯一的小写英文字母数量。通过使用标记数组来记录每个字母是否出现过，最终输出不重复字母的数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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
3
input
{b, a, b, a}
output
2
input
{}
output
0

模拟没什么可说的

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
using namespace std;
bool mark[27];
int ans;
int main()
{
    char ch;
    while (1)
    {
        while ((ch!='}')&&(ch<'a'||ch>'z')) scanf("%c",&ch);
        if (ch=='}') break;
        if (!mark[ch-'a'])
        {
            mark[ch-'a']=1;
            ans++;
        }
        ch=' ';
    }
    printf("%d",ans);
}

转载于:https://www.cnblogs.com/zhber/p/4035962.html