zoukankan      html  css  js  c++  java
  • codeforces 520 Pangram

    http://codeforces.com/problemset/problem/520/A

    A. Pangram
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input:standard input
    output:standard 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.

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


    分析:

    就是判断每一个字母是否都出现一次,大小写不计。


    AC代码:

     1 #include <stdio.h>
     2 #include <algorithm>
     3 #include <iostream>
     4 #include <string.h>
     5 #include <string>
     6 #include <math.h>
     7 #include <stdlib.h>
     8 #include <queue>
     9 #include <stack>
    10 #include <set>
    11 #include <map>
    12 #include <list>
    13 #include <iomanip>
    14 #include <vector>
    15 #pragma comment(linker, "/STACK:1024000000,1024000000")
    16 #pragma warning(disable:4786)
    17 
    18 using namespace std;
    19 
    20 const int INF = 0x3f3f3f3f;
    21 const int MAX = 200 + 10;
    22 const double eps = 1e-8;
    23 const double PI = acos(-1.0);
    24 
    25 char str;
    26 map<char , int>ma;
    27 
    28 int main()
    29 {
    30     int n;
    31     while(~scanf("%d",&n))
    32     {
    33         ma.clear();
    34         int i;
    35         for(i = 0;i <= n;i ++)
    36         {
    37             scanf("%c", &str);
    38             if(str >= 'A' && str <= 'Z')
    39                 ma[str - 'A'] ++;
    40             else
    41                 ma[str - 'a'] ++;
    42         }
    43         for(i = 0;i < 26;i ++)
    44             if(ma[i] == 0)
    45             {
    46                 cout << "NO" << endl;
    47                 break;
    48             }
    49         if(i == 26)
    50             cout << "YES" << endl;
    51     }
    52     return 0;
    53 }
    View Code
  • 相关阅读:
    寻找SQL注入点
    根域名服务器
    Solr 文章集成
    Android事件分发机制
    王自如与老罗的辩论赛谁赢了?!
    ACdream原创群赛(13)のwuyiqi退役专场 C True love
    使用JS对select标签进行联动选择
    c++代码赏析之类对象传參
    基因治疗的现状
    解决手机訪问站点时总体相对屏幕缩小问题?(已解决)
  • 原文地址:https://www.cnblogs.com/jeff-wgc/p/4458404.html
Copyright © 2011-2022 走看看