-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathalarma.cpp
57 lines (46 loc) · 1.25 KB
/
alarma.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
#include <bits/stdc++.h>
using namespace std;
vector<string> lista;
vector< pair<string,int> > inputs;
int Find(const string a,const int b){
int res=0;
for(int i=0;i<b;i++){
if( inputs[i].first == a.substr(0,inputs[i].first.size() ) ){
res++;
}
}
if(res==0)
lista.push_back(a);
return res;
}
bool metodo1(const pair<string,int> a, const pair<string,int> b){
if(a.first.size() == b.first.size())
return a.first < b.first;
return a.first.size() < b.first.size();
}
int main(){
ifstream fin("in.txt");
ofstream fout("out.txt");
int n;
string input;
fin >> n;
while(fin >> input){
inputs.push_back(make_pair(input,0));
}
sort(inputs.begin(),inputs.end(),metodo1);
for(int i=0;i<inputs.size();i++){
n=Find(inputs[i].first,i);
if(n!=0)
inputs[i].second = n;
}
for(int i=0;i<lista.size();i++){
fout << 0 << ' ' << lista[i] << endl;
for(int j=0;j<inputs.size();j++){
if(inputs[j].second!=0){
if(lista[i] == inputs[j].first.substr(0,lista[i].size())){
fout << inputs[j].second << ' ' << inputs[j].first << endl;
}
}
}
}
}