Accepted solution

520A - Pangram

Open original problem
Source code

#include <iostream>

#include<vector>

#include<string>

#include<math.h>

#include<set>

#include<map>

#include<algorithm>

/***** S. M. Sabiul Hajjaj Sabit *****/

using namespace std;

template <typename T>long long int power(T a, T b)

{

    long long int pow=1;

    for(int i=0; i<b; i++)

    {

        pow *= a;

    }

    return pow;

}

///*********Write Code From Here*********///

int main()

{

    int n;

    int sum=0;

    vector<int>arr(26,0);

    cin>>n;

    for(int i=0; i<n; i++)

    {

        char c;

        cin>>c;

        if(c>='a' && c<='z')arr[(int)c-97]=1;

        else arr[(int)c-65]=1;

    }

    for(int i=0; i<26; i++)

    {

        sum+=arr[i];

    }

    if(sum==26) cout<<"YES"<<endl;

    else cout<<"NO"<<endl;

}
Join the discussion

Add your comment