We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. NP Complete
  4. Spies, Revised
  5. Discussions

Spies, Revised

Sort by

recency

|

100 Discussions

|

  • vitp15
     + 0 comments

    9

    1 7 4 6 9 2 5 3 8

    why this solution is not accepted?

  • solentador
     + 1 comment

    There might be an error in code control, the following output matrix seems true.

    "3 1 4 2 5"

  • [deleted]     + 0 comments

    Works 

    print(9)
print("5 2 4 9 7 3 1 6 8")

  • sarmed_edward
     + 0 comments

    How old is this?

    In year 2000 as a recent Computer Grad, I resolved the Queens on chess board (from Java Deitel and Deitel): That is:

    How many queens can we add into a chess board so that no queen captures the other?! Output is 8, where they are a chess knight distance from each other

  • borucki_andrzej
     + 1 comment

    I test median time for N from 10 to 100 and complexity is N^5. It means, that for N=999, for 4-cores processor it take 48 full days. (can be several shorter or longer). I don't public my code and algorithm due to not spoil game.