A. Pangram

题目链接：http://codeforces.com/problemset/problem/520/A

520A. Pangram

time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output

题意
A word or a sentence in some language is called a pangram if all the characters of the alphabet of this language appear in it at least once. Pangrams are often used to demonstrate fonts in printing or test the output devices.
You are given a string consisting of lowercase and uppercase Latin letters. Check whether this string is a pangram. We say that the string contains a letter of the Latin alphabet if this letter occurs in the string in uppercase or lowercase
.
输入描述
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of characters in the string.
The second line contains the string. The string consists only of uppercase and lowercase Latin letters.

输出描述
Output
Output “YES”, if the string is a pangram and “NO” otherwise.

例子
Examples

Input
12
toosmallword
Output
NO

Input
35
Output
YES

题目大意：输入一串含有大小写的字符，判断26位字母是否全出现过

解题思路：可使用set将读入的字符做一定操作后进行排序，或直接暴力判断

代码

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
using namespace std;

int main(){
    int n;
    string s;
    while(scanf("%d",&n)!=EOF){
        cin>>s;
        set<int>m;
        for(int i = 0; i < n; i ++){
            if(s[i] >= 'A' && s[i] <= 'Z')
                m.insert(s[i] - 'A');
            else if(s[i] >= 'a'&&s[i] <= 'z')
                m.insert(s[i] - 'a');
        }
        if(m.size()==26)
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<endl;
    }
    return 0;
}