zoukankan      html  css  js  c++  java
  • Y

    Problem description

    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
    解题思路:统计花括号中不同字母的个数,set容器水过!
    AC代码:
     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 int main(){
     4     string s;set<char> se;
     5     getline(cin,s);
     6     for(int i=0;s[i]!='';++i)
     7         if(s[i]>='a'&&s[i]<='z')se.insert(s[i]);
     8     cout<<se.size()<<endl;
     9     return 0;
    10 }
    
    
  • 相关阅读:
    Web前端性能优化-资源合并与压缩
    关于 ES5 & ES6 数组遍历的方法
    代码优化
    解决 Vue 刷新页面后 store 数据丢失的问题
    Lombok
    Dao 与 Dto
    物理删除与逻辑删除的区别
    Java 创建对象的几种方式
    SSM + SpringBoot 常用注解
    Json Web Token (JWT)
  • 原文地址:https://www.cnblogs.com/acgoto/p/9192321.html
Copyright © 2011-2022 走看看