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
#include <iostream>
#include <cstdlib>

using namespace std;

class Road {
public:
	int ca;
	int cb;
};

Road roads[512];

int n, m, d;
int S[128];

int dCount(int city)
{
	int result = 0;
	for (int i = 1; i <= m; i++)
	{
		if (roads[i].ca == city || roads[i].cb == city)
			result++;
	}
	return result;
}

int main()
{
	do {
		cin >> n;
	} while (n < 2 || n > 200000);
	do {
		cin >> m;
	} while (m < 1 || m > 200000);
	do {
		cin >> d;
	} while (d < 1 || d >= n);
	for (int i = 1; i <= m; i++)
	{
		do {
			cin >> roads[i].ca;
		} while (roads[i].ca < 1 || roads[i].ca > n);
		do {
			cin >> roads[i].cb;
		} while (roads[i].cb < 1 || roads[i].cb == roads[i].ca || roads[i].cb > n);
	}
	//Calculations
	int sCount = 0;
	for (int i = 1; i <= n; i++)
	{
		if (dCount(i) >= d)
		{
			S[sCount] = i;
			sCount++;
		}

	}

	if (sCount <= 1)
		cout << "NIE";
	else {
		cout << sCount << "\n";
		for (int i = 0; i < sCount; i++)
			cout << S[i] << " ";
	}
	system("pause");
}