zoukankan      html  css  js  c++  java
  • Codeforces Round #295 (Div. 2)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

    题意:问你26个英文字母是否用完
    题解:用一个flag记录一下就好
    int flag[30];
    string s;
    int main()
    {
        cin>>s;
        cin>>s;
        REP(i,s.size())
        {
            if('a'<=s[i]&&s[i]<='z')
                flag[s[i]-'a']=1;
            else
                flag[s[i]-'A']=1;
        }
        REP(i,26)
        {
            if(flag[i]==0)
            {
                cout<<"NO"<<endl;
                return 0;
            }
        }
        cout<<"YES"<<endl;
    }
  • 相关阅读:
    算法 quick sort
    非常多学ThinkPHP的新手会遇到的问题
    原创jQuery插件之图片自适应
    管理线程之向线程函数传递參数
    [LeetCode]94.Binary Tree Inorder Traversal
    数据库基本概念
    Eclipse4.4 安装java反编译插件Eclipse Class Decompiler
    广义线性模型
    代理模式
    多态之中的一个(继承和虚函数)
  • 原文地址:https://www.cnblogs.com/qscqesze/p/4313007.html
Copyright © 2011-2022 走看看