Yandex.Algorithm Online Round 3 Sunday, June 15, 2014
ProblemA.Distance求树中距离恰好为2的结点对的个数#include
#include
#include
usingnamespacestd;
intedge[100007];
intmain(){
intt;
while(scanf("%d",&t)!=EOF){
for(inti=1;i
#include
#include
#include
usingnamespacestd;