code_fille's blog

How to solve this question-to find no. of paths(length<=k) between given pair of cities.
By code_fille, 9 years ago, In English

The problem statement can be found here-> (http://www.codechef.com/DBYZ15/problems/DBYZ15C).

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

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

Matrix exponentiation

→ Reply
  • »
    »
    9 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    What about dfs?

    We will get TLE by that?

    → Reply
»
9 years ago, # |
← Rev. 3   Vote: I like it 0 Vote: I do not like it

http://stackoverflow.com/questions/18890570/matrix-power-sum

→ Reply