CodeforcesSolvedProblems/Codeforces_Pangram.cpp at master · JoyCmollik/CodeforcesSolvedProblems · 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
59
60
61

#include <bits/stdc++.h>

using namespace std;

int main() {
    int nmbr;
    cin >> nmbr;

    vector < char > listOfletters;

    while(nmbr--) {
        char letter;
        cin >> letter;

        listOfletters.push_back(letter);
    }

    char ch = 97;
    bool found = false;

    for(int i = 0; i < 26; i++) {
        found = false;
        for(int x = 0; x < listOfletters.size(); x++) {
            if(listOfletters[x] >= 'A' && listOfletters[x] <= 'Z') {
                listOfletters[x] += 32;
            }

            if(ch == listOfletters[x]) {
                found = true;
                break;
            }
        }
        if(found) {
            ch++;
            continue;
        }
        else {
            break;
        }
    }

    if(found) {
        cout << "YES" << endl;
    }
    else {
        cout << "NO" << endl;
    }


    return 0;
}