-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path10-date..cpp
70 lines (52 loc) · 1.37 KB
/
10-date..cpp
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
62
63
64
65
66
67
68
69
70
#include <iostream>
#include <string>
#include <unordered_set>
#include <cctype>
int main() {
int n;
std::cin >> n;
int pangramCount = 0;
std::cin.ignore();
while (n--) {
std::string str;
std::getline(std::cin, str);
std::unordered_set<char> uniqueChars(str.begin(), str.end());
for (auto& c : uniqueChars) {
if (!std::isalpha(c)) {
uniqueChars.erase(c);
} else {
const char &c = std::tolower(c);
}
}
if (uniqueChars.size() == 26) {
pangramCount++;
}
}
std::cout << pangramCount << std::endl;
return 0;
}
#include <iostream>
#include <string>
#include <unordered_set>
#include <cctype>
int main() {
int n;
std::cin >> n; // Number of strings
int pangramCount = 0;
std::cin.ignore(); // Ignore the newline character after the integer input
while (n--) {
std::string str;
std::getline(std::cin, str); // Input string
std::unordered_set<char> uniqueChars;
for (char c : str) {
if (std::isalpha(c)) {
uniqueChars.insert(std::tolower(c));
}
}
if (uniqueChars.size() == 26) {
pangramCount++;
}
}
std::cout << pangramCount << std::endl;
return 0;
}