Pagini recente » Cod sursa (job #2899292) | Cod sursa (job #2632635) | Cod sursa (job #1483635) | Cod sursa (job #1702396) | Cod sursa (job #466485)
Cod sursa(job #466485)
#include<stdio.h>
#include<vector>
#define p 1000000007
#define NMAX 100010
using namespace std;
//dfs
vector<long> v[NMAX],v1[NMAX];
int n,k,tip[NMAX],viz[NMAX];
long long rez=1;
int hm(int nod)
{
int i,cont=0;
for (i=0;i<v[nod].size();++i)
if (tip[v1[nod][i]])
++cont;
return cont;
}
void dfs(int nod)
{
int i,c1=0,c2=0;
for (i=0;i<v[nod].size();++i)
if (tip[v1[nod][i]]==0)
{
c1=hm(nod);
c2=hm(v[nod][i]);
if (c1+c2>k)
rez=0;
rez=(rez*(k-c1-c2))%p;
tip[v1[nod][i]]=1;
}
for (i=0;i<v[nod].size();++i)
if (!viz[v[nod][i]])
{
viz[v[nod][i]]=1;
dfs(v[nod][i]);
}
}
int main()
{
int i,t1,t2;
freopen("colorare3.in","r",stdin);
freopen("colorare3.out","w",stdout);
scanf("%d%d",&n,&k);
for (i=1;i<=n-1;++i)
{
scanf("%d%d",&t1,&t2);
v[t1].push_back(t2);
v1[t1].push_back(i);
v[t2].push_back(t1);
v1[t2].push_back(i);
}
viz[1]=1;
dfs(1);
printf("%lld",rez);
return 0;
}