Codeforces/520A.cpp at master · AnikNicks/Codeforces · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#include <iostream>
#include <string>
#include <streambuf>
#include <fstream>
#include <string.h>
#include <algorithm>
#include <vector>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <map>
#include <set>
#include <stdlib.h>
#include <cstdio>
#include <vector>
#include <queue>
#include <utility>
#include <math.h>

using namespace std;
#define pi acos(-1.0)
#define N 1000000
#define ll long long
using namespace std;

vector < ll > cell;
bool visited[30];
char s[105];
int main()
{
    ll x,y,a,b,n,m,e,t,count=0;
    memset(visited,0,sizeof(visited));
    scanf("%lld %s",&n,&s);
    for(ll i=0;i<n;i++)
    {
        if(s[i]>='A' && s[i]<='Z')
        {
            if(!visited[s[i]-'A'])
            {
                count++;
                visited[s[i]-'A']=1;
            }
        }
        else
        {
            if(!visited[s[i]-'a'])
            {
                count++;
                visited[s[i]-'a']=1;
            }
        }
    }
    if(count==26)
        cout << "YES"<< endl;
    else
        cout << "NO" << endl;
    return 0;
}