-
Notifications
You must be signed in to change notification settings - Fork 1
/
solution.cpp
48 lines (42 loc) · 1.17 KB
/
solution.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
#include <iostream>
#include <string>
#include <map>
#include <algorithm>
using namespace std;
struct Node{
map<int, Node*>children;
};
Node* head;
int counter;
void addTelephone(string telephone);
/**
* Auto-generated code below aims at helping you parse
* the standard input according to the problem statement.
**/
int main()
{
int N;
counter = 0;
head = new Node{};
cin >> N; cin.ignore();
for (int i = 0; i < N; i++) {
string telephone;
cin >> telephone; cin.ignore();
addTelephone(telephone);
}
// Write an action using cout. DON'T FORGET THE "<< endl"
// To debug: cerr << "Debug messages..." << endl;
cout << counter << endl; // The number of elements (referencing a number) stored in the structure.
}
void addTelephone(string telephone){
auto node = head;
for(int i = 0; i < telephone.size(); ++i){
int number = telephone.at(i) + '0';
auto it = node->children.find(number);
if(it == node->children.end()){
node->children[number] = new Node{};
counter++;
}
node = node->children[number];
}
}