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<vector>
#include<algorithm>
using namespace std;
class town{
public:
    int S;
    int P;
};


int main(){
    town V[200002];
    int pick[200002];
    int n,m,d,a,b,Smax=0,count;
    cin>>n;
    cin>>m;
    cin>>d;
    for(int i=1;i<=m;i++){
        cin>>a;
        cin>>b;
        V[a].P++;
        V[b].P++;
        if(V[a].S == 0)V[a].S=i;
        if(V[b].S == 0)V[b].S=i;
        if(V[a].S < V[b].S)V[b].S=V[a].S;
        else V[a].S=V[b].S;
    }
    for(int i=1;i<=m;i++){
        if( Smax<V[i].S && V[i].P>=d )Smax=V[i].S;
    }
    if(Smax==0){
        cout<<"NIE"<<endl;
        return 0;
    }
    else{
        for(int i=1;i<=m;i++){
            if(Smax==V[i].S && V[i].P>=d) count++;
        }
        if (count<=1) {cout<<"NIE"<<endl;return 0;}
        cout<<count<<endl;
        for(int i=1;i<=m;i++){
            if(Smax==V[i].S && V[i].P>=d) cout<<i<<" ";
        }
    }

return 0;
}