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
#include <iostream>
#include <set>
#include <vector>

using namespace std;

int main()
{
	int m, n, d;
	int a, b;
	bool begin;
	vector<set<int>> drogi;
	set<int> miasta, analiza;
	cin >> n >> m >> d;
	drogi.resize(n+1);
	for (int i = 0;i < m;i++)
	{
		cin >> a >> b;
		drogi[a].insert(b);
		drogi[b].insert(a);
	}
	for (int i = 1;i <= n;i++)
	{
		begin = 0;
		if (drogi[i].size() >= d)
			miasta.insert(i);
		else {
			if (analiza.find(i) == analiza.end())
			{
				for (set<int>::iterator it = drogi[i].begin(); it != drogi[i].end(); ++it)
				{
					drogi[*it].erase(i);
					if (*it < i)
						begin = 1;
				}
				analiza.insert(i);
				if (begin)
				{
					miasta.clear();
					i = 1;
				}
			}	
		}
	}
	if (miasta.size()>0)
	{
		cout << miasta.size() << endl;
		for (set<int>::iterator it = miasta.begin(); it != miasta.end(); ++it)
		{
			cout << *it << " ";
		}
	}
	else
		cout << "NIE";
	return 0;
}