-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.cpp
More file actions
68 lines (60 loc) · 2.01 KB
/
main.cpp
File metadata and controls
68 lines (60 loc) · 2.01 KB
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
#include<iostream>
#include<fstream>
#include <algorithm>
#include <cctype>
int main() {
std::ifstream fin("text.in");
std::ofstream fout("text.out");
std::string words[100], line, word;
int lines = 0, y = 0, counter[100] = {0};
while (std::getline(fin, line)) {
if (line.empty()) continue;
word = "";
for (int i = 0; i < line.length(); i++) {
if (line[i] == ' ' || line[i] == '!' || line[i] == '?' || line[i] == '.' || line[i] == ',') {
if (!word.empty()) {
std::transform(word.begin(), word.end(), word.begin(), [](unsigned char c){ return std::tolower(c); });
bool found = false;
for (int j = 0; j < y; j++) {
if (words[j] == word) {
counter[j]++;
found = true;
break;
}
}
if (!found) {
words[y] = word;
counter[y]++;
y++;
}
word = "";
}
} else {
word += line[i];
}
}
if (!word.empty()) {
std::transform(word.begin(), word.end(), word.begin(), [](unsigned char c){ return std::tolower(c); });
bool found = false;
for (int j = 0; j < y; j++) {
if (words[j] == word) {
counter[j]++;
found = true;
break;
}
}
if (!found) {
words[y] = word;
counter[y]++;
y++;
}
}
lines++;
}
for (int i = 0; i < y; i++) {
fout << words[i] << " " << counter[i] << std::endl;
}
fin.close();
fout.close();
return 0;
}