Anton and Letters
2014-07-17 16:41
567 查看
Anton and Letters
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard 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.
Sample test(s)
Input
Output
Input
Output
Input
Output
题意:判断集合里元素的个数,即不算重复的。
AC代码:
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard 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.
Sample test(s)
Input
{a, b, c}
Output
3
Input
{b, a, b, a}
Output
2
Input
{}
Output
0
题意:判断集合里元素的个数,即不算重复的。
AC代码:
import java.util.*; public class Main { public static void main(String[] args) { Scanner scan=new Scanner(System.in); String s=scan.nextLine(); char a[]=new char[s.length()]; a=s.toCharArray(); int b[]=new int[100]; for(int i=0;i<s.length();i++){ if(a[i]!=' '&&a[i]!=','&&a[i]!='{'){ b[a[i]-'a']=1; } if(a[i]=='}') break; } int ans=0; for(int i=0;i<26;i++){ if(b[i]==1) ans++; } System.out.println(ans); } }
相关文章推荐
- CodeForces 443A Anton and Letters
- Anton and Letters - CF#253 (Div. 2)A (443A) 大水
- 443A - Anton and Letters
- cf443A Anton and Letters
- cf443A Anton and Letters
- CF 253A. Anton and Letters
- Codeforces Round #253 (Div. 2) A. Anton and Letters
- Codeforces Round #253 (Div. 2)A. Anton and Letters
- cf443A Anton and Letters
- A. Anton and Letters
- COdeforces 443A - Anton and Letters (set)
- Codeforces Round #253 (Div. 2) A. Anton and Letters
- codeforces——443A——Anton and Letters
- Codeforces 443A Anton and Letters(水题)
- Anton and Letters
- Codeforces Round #253 (Div. 2)A. Anton and Letters
- Codeforces Round #253 (Div. 2) A. Anton and Letters
- Codeforces Anton and Letters
- CodeForces 443A Anton and Letters
- A. Anton and Letters