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
/*
Trie tree construction and functions
Author: cxw
Email: cxweieee@126.com
Reference: hiho1014
Link: http://hihocoder.com/problemset/problem/1014
Tag: Trie, trie, dictionary tree
*/
// Trie tree, or dictionary tree
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
int cmp(int a, int b){
    return a<b;
}
int a[100010];
int b[100010];
int main(){
    int n;
    while(cin>>n){
        for(int i = 0; i < n; i++){
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX