Please help me solve this problem
Difference between en1 and en2, changed 72 character(s)
Given a weighted graph with n nodes and m edges. for each node v we should calculate number of nodes u such that d(v,u)<=k .↵
n,m<=5e4  k<=100;↵
Please somebody help me.↵
UPD: I don't know if it's important or not but Wi<=100 for every edge.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English EBAD 2018-01-12 21:32:57 72
en1 English EBAD 2018-01-12 15:20:12 202 Initial revision (published)