Codeforces Round #295 A. Pangram

来源：互联网发布：淘宝红包雨从哪里找编辑：程序博客网时间：2024/05/22 09:55

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.

Sample test(s)
input
12toosmallword
output
NO
input
35TheQuickBrownFoxJumpsOverTheLazyDog
output
YES

标准水题一枚，先全部转化成小写，然后用个数组做个统计，看看是不是26个字母全有了就行了。

package com.codeforces.algorithm;import java.io.PrintWriter;import java.util.*;public class Pangram {public static void main(String []args){Scanner cin = new Scanner(System.in);PrintWriter cout = new PrintWriter(System.out);while(cin.hasNext()){int n = cin.nextInt();String str = cin.next();String ptr = str.toLowerCase();int []num = new int[27];for(int i=0;i<27;i++) num[i]=0;for(int i=0;i<ptr.length();i++){num[ptr.charAt(i)-'a']++;}boolean flag=true;for(int i=0;i<26;i++){if(num[i]==0){flag=false;break;}}if(flag){cout.println("YES");}else{cout.println("NO");}cout.flush();}cout.close();}}

0 0