travelers's blog

By travelers, history, 8 years ago, In English

Can any one help in this problem.I tried to solve it by finding in degree edges but getting WA problem link: Uva-10305 my solution : here

  • Vote: I like it
  • +5
  • Vote: I do not like it

»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

the last for shoud be this :

for(i=0;i<=n;i++)edgelist[i].clear();

instead of this :

for(i=0;i<n;i++)edgelist[i].clear();