Codeforces Round #295 A. Pangram
来源:互联网 发布:程序员代码面试指南 编辑:程序博客网 时间:2024/06/03 00:07
大水,先判断大小写,然后记录一下,最后查一下记录结果。完成.
Description
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 Input
12toosmallword
NO
35TheQuickBrownFoxJumpsOverTheLazyDog
YES
#include<cstdio>#include<cmath>#include<iostream>#include<cstdlib>#include<algorithm>#include<string.h>using namespace std;char a[40];int main(){ int n; memset(a, 0, sizeof(a)); char str[120]; cin>>n>>str;// for(int i = 0 ; i < n ; i++)// printf("%c ", str[i]); if( n < 26) cout<<"NO"<<endl; else { for(int i = 0 ; i < n ; i++) { if(str[i] >= 'a') a[str[i] - 'a']++; if(str[i] < 'a') a[str[i] - 'A']++; }// for(int i = 0 ; i < 26 ; i++)// printf("%d\n",a[i]); for(int i = 0 ; i < 26 ; i++) { if(a[i] == 0) {// printf("%d\n", i); cout<<"NO"<<endl; return 0; } } cout<<"YES"<<endl; } return 0;}
- Codeforces Round #295 A. Pangram
- Codeforces Round #295 A. Pangram
- Codeforces Round #295 (Div. 2) -- A. Pangram
- Codeforces Round #295 (Div. 2) A. Pangram
- Codeforces Round #295 (Div. 2), problem: (A) Pangram
- Codeforces Pangram
- A Pangram
- A. Pangram
- Codeforces #295(Div 2) A Pangram、B Two Buttons、C DNA Alignment
- codeforces——520A——Pangram
- 520A Pangram【implement】
- Pangram
- Codeforces Round #295 (Div. 1) (A B)
- Codeforces Round #295 (Div. 2) A、B
- codeforces round#283 A
- Codeforces Round #234A
- Codeforces Round #439 A
- codeforces div2 round#231 A
- 关于提高浏览器渲染页面速度的建议
- D3js-API介绍【中】
- Android屏蔽后退键
- Bluetooth--- android 蓝牙通信编程
- Eclipse中Maven+Spring3.2.8+SpringMVC HelloWorld项目
- Codeforces Round #295 A. Pangram
- #java从头再来#Servlet+JDBC+MYSQL
- net.sf.json.JSONObject 和org.json.JSONObject 的差别
- 体验VisualStudio 2013中的内存分析功能
- 最长递增子序列 Longest Increasing Subsequence (LIS)
- D3js-API介绍【英】
- Ubuntu14.04 安装Firefox flash插件
- 结构体大小与sizeof
- android custom viewgroups 性能分析