Sort by

recency

|

7 Discussions

|

  • + 0 comments

    At least the author put number 5 (or bigger) in the test cases for the better visualization.

  • + 0 comments

    Solved using Monte Carlo! The accuracy required is not insanely high (just the integral part) and the number of nodes is reasonably small (<=30), leaving plenty of time to run the simulation many times (I could do it 500,000 times using C++ under the time limit) stochastically to find an approximate average. I'm not sure if this is the intended way, though.

  • + 0 comments

    What does nonadjacen mean?

    "We choose each pair of nonadjacent cities with equal probability."

    Should it say nonconnected?

    Thanks!

  • + 0 comments

    This is a truly awfull site and a realy bad question, just embarising.

  • + 0 comments

    Hello! I am looking to this problem for a while now, but unfortunately I can't find the right approach to attack it. Could someone please provide some hint, i.e. some probability terms/techniques so I can search correctly?