20200204A

题目：

A - Pangram CodeForces - 520A

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 TheQuickBrownFoxJumpsOverTheLazyDog Output YES

题解：

从字符串头扫描到尾，判断26个英文字母是否出现就行了

代码：

#include <iostream> using namespace std; int main() { int n; scanf("%d",&n); string a; int b[26]={0}; cin>>a; for(int i=0;i<n;i++){ if(a[i]>='a'&&a[i]<='z') b[a[i]-'a']=1; if(a[i]>='A'&&a[i]<='Z') b[a[i]-'A']=1; } int x=1; for(int i=0;i<26;i++) if(!b[i]) x=0; if(x) printf("YES"); else printf("NO"); return 0; }