-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path5670.cpp
More file actions
92 lines (75 loc) Β· 1.66 KB
/
5670.cpp
File metadata and controls
92 lines (75 loc) Β· 1.66 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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
#include <iostream>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
bool inital;
char arr[100000][81];
int ans;
struct Trie{
Trie* node[26];
int cnt;
bool finish;
Trie(){
for(int i=0; i<26; i++)
node[i] = NULL;
finish = false;
cnt = 0;
}
~Trie(){
for(int i=0; i<26; i++)
if(node[i] != NULL)
delete node[i];
}
int to_num(char c){
return tolower(c) - 'a';
}
void insert(char *words){
if(*words == '\0'){
finish = true;
return;
}
int cur = to_num(*words);
if(node[cur] == NULL){
node[cur] = new Trie();
cnt++;
}
// μ£Όμκ° 1 μ¦κ° == λ€μ λ¨μ΄ κ°λ¦¬ν€κΈ°
node[cur]->insert(words + 1);
}
void find(char* words){
if(*words == '\0')
return;
if(inital){
inital = false;
ans++;
}
else{
if(finish)
ans++;
else if(cnt > 1)
ans++;
}
int cur = to_num(*words);
node[cur]->find(words + 1);
}
};
int main(void){
ios::sync_with_stdio(false);
cin.tie(0);
int N;
while(cin>>N){
Trie* root = new Trie();
ans = 0;
for(int i=0; i<N; i++){
cin>>arr[i];
root->insert(arr[i]);
}
for(int i=0; i<N; i++){
inital = true;
root->find(arr[i]);
}
cout<<fixed<<setprecision(2)<<(double)ans / (double)N<<"\n";
delete root;
}
}