rajon_aust's blog

By rajon_aust, history, 11 years ago, In English

I don't find any solution idea for this problem . I am totally stuck in this problem . If anyone solve the problem , please give me the idea for this problem . Thanks in advance !

http://www.spoj.com/problems/HIGH/

  • Vote: I like it
  • 0
  • Vote: I do not like it

| Write comment?
»
11 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by rajon_aust (previous revision, new revision, compare).

»
11 years ago, hide # |
← Rev. 2  
Vote: I like it 0 Vote: I do not like it

OP changed the question from HIGHWAY — > HIGH . This comment is uselss

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

Auto comment: topic has been updated by rajon_aust (previous revision, new revision, compare).

»
11 years ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

I think the problem is just counting spanning trees