blob: fdd3e88220d844c5cdd6220540b7f8cb9f50db36 (
plain)
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
|
#include<iostream>
#include<fstream>
using namespace std;
template<class T>
class node {
public:
node(T key, node* parent, node* right, node* left) : _key{key}, _parent{parent}, _right{right}, _left{left} {}
T& key() { return _key; }
const T& key() const { return _key; }
node<T>*& parent() { return _parent; }
const node<T>*& parent() const { return _parent; }
node<T>*& right() { return _right; }
const node<T>*& right() const { return _right; }
node<T>*& left() { return _left; }
const node<T>*& left() const { return _left; }
private:
T _key;
node<T>* _parent;
node<T>* _right;
node<T>* _left;
};
class bst {
public:
bst() : _duplicates{0}, _root{nullptr} {}
bst* add(int val) {
node<int>* iter = _root;
node<int>* prev = nullptr;
while(iter) {
prev = iter;
if(iter->key() == val) {
_duplicates++;
return this;
}
if(iter->key() > val)
iter = iter->right();
else
iter = iter->left();
}
node<int>* nodus = new node<int>{val, prev, nullptr, nullptr};
if(!prev)
_root = nodus;
else if(prev->key() > val)
prev->right() = nodus;
else
prev->left() = nodus;
return this;
}
const int& duplicates() const { return _duplicates; }
private:
int _duplicates;
node<int>* _root;
};
int main() {
ifstream in("input.txt");
ofstream out("output.txt");
for(int ts = 0; ts < 100; ++ts) {
bst* b = new bst{};
int n;
in >> n;
int e;
for(int i = 0; i < n; ++i) {
in >> e;
b->add(e);
}
out << b->duplicates() << endl;
}
in.close();
out.close();
return 0;
}
|
