adsfjkkdshfkasjfk

#include <iostream>#include <stdio.h>#include <string.h>#include <vector>#include <algorithm>#include <queue>#include <cmath>#include <map>#define eps 0.0000000001#define maxn 3009#define inf 0x3f3f3f3f#define mod 1000000009#define ll long longusing namespace std;vector<int> g[maxn];int du[maxn];int n,m,d;bool v[maxn]，vv[maxn];vector<int> ans,tmp;int an=0;void dfs(int a){    for(int i=0;i<g[a].size();i++)    {        if(v[a]||vv[a])            continue;        tmp.push    }}int main(){    //freopen("d:\\in.txt","r",stdin);    scanf("%d%d%d",&n,&m,&d);    for(int i=1;i<=m;i++)    {        int a,b;        scanf("%d%d",&a,&b);        du[a]++;        g[a].push_back(b);        du[b]++;        g[b].push_back(a);    }    queue<int> q;    for(int i=1;i<=n;i++)    {        if(du[i]<d)        {            q.push(i);        }    }    while(!q.empty())    {        int u=q.front();        for(int i=0;i<g[u].size();i++)        {            d[g[u][i]]--;            if(v[g[u][i]])                continue;            else if(d[g[u][i]]<d)                v[g[u][i]]=true;        }    }    for(int i=1;i<=n;i++)    {        dfs(i);    }    return 0;}