-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathnodes.cpp
More file actions
85 lines (74 loc) · 1.96 KB
/
Copy pathnodes.cpp
File metadata and controls
85 lines (74 loc) · 1.96 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
#include <iostream>
#include <vector>
#include <random>
class Node
{
public:
int data[3];
};
bool element_present( int element, std::vector<Node> *nodes )
{
for( auto it = nodes->begin(); it != nodes->end(); ++it )
{
for( int i = 0; i < 3; ++i )
{
if( it->data[i] == element ) return true;
}
}
return false;
}
int main( int argv, char *argc[] )
{
std::random_device rd;
std::mt19937 g( rd() );
std::vector<int> data( 1000 );
int i = 0;
for( auto it = data.begin(); it != data.end(); ++it )
{
*it = i++;
}
for( int j = 0; j < 200; ++j )
{
std::vector<Node> nodes( 1000 );
i = 0;
for( auto it = nodes.begin(); it != nodes.end(); ++it )
{
it->data[0] = data[i];
it->data[1] = data[(i + 1) % data.size()];
it->data[2] = data[(i + 2) % data.size()];
++i;
}
for( i = 0; i < 3; ++i )
{
std::uniform_int_distribution<int> distribution( 0, nodes.size() - 1 );
int erased_idx = distribution( g );
nodes.erase( nodes.begin() + erased_idx );
}
std::vector<int> missing_elements;
for( i = 0; i < 1000; ++i )
{
if( !element_present( i, &nodes ) )
{
missing_elements.push_back( i );
}
}
if( missing_elements.empty() )
{
std::cout << "no missing elements" << std::endl;
}
else
{
std::cout << "missing elements:" << std::endl << "{ ";
for( auto it = missing_elements.begin(); it != missing_elements.end(); ++it )
{
std::cout << *it;
if( it + 1 != missing_elements.end() )
{
std::cout << ",";
}
std::cout << " ";
}
std::cout << "}" << std::endl;
}
}
}