-
Notifications
You must be signed in to change notification settings - Fork 0
/
contact.cpp
100 lines (82 loc) · 1.94 KB
/
contact.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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
/*
ID: ...
PROG: contact
LANG: C++11
*/
#include <iostream>
#include <fstream>
#include <map>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
struct Sequence {
int n;
string s;
bool ready;
Sequence(int s) : n(s), ready(false) {}
void rotate(char l) {
if (ready) {
s = s.substr(1, s.size() - 1) + l;
} else {
s.push_back(l);
ready = s.size() == n;
}
}
};
static bool compareSeqString(string a, string b)
{
if (a.size() == b.size()) {
return a < b;
} else {
return a.size() < b.size();
}
}
int main() {
ofstream fout ("contact.out");
ifstream fin ("contact.in");
int A, B, N;
fin >> A >> B >> N;
string s;
std::vector<Sequence> sequences;
for (int i = A; i <= B; ++i) {
sequences.push_back({i});
}
std::map<string, int> t1;
while(fin >> s) {
for (size_t i = 0; i < s.size(); ++i) {
for (size_t j = 0; j < sequences.size(); ++j) {
sequences[j].rotate(s[i]);
if (sequences[j].ready) {
t1[sequences[j].s]++;
}
}
}
}
std::map<int, vector<string>> t2;
for (auto& it : t1) {
t2[it.second].push_back(it.first);
}
for (auto& it : t2) {
std::sort(it.second.begin(), it.second.end(), compareSeqString);
}
int counter = 0;
for (auto it = t2.rbegin(); it != t2.rend(); ++it) {
counter++;
fout << it->first << endl;
for (size_t i = 0; i < it->second.size(); ++i) {
fout << it->second[i];
if ((i + 1) % 6 == 0) {
fout << endl;
continue;
}
if (i < it->second.size() - 1) {
fout << " ";
} else {
fout << endl;
}
}
if (counter == N) break;
}
return 0;
}