Ad
  • Custom User Avatar

    My solution on C# passed for any tests but failed on performance and random tests. And always result different for 1 (Expected: 405
    But was: 404 for example). Whats wrong with this tests?

  • Custom User Avatar

    You should to create better algorythm for calculate best combination of 7 card instead 5 in this Kata. And input data will playerHand, opponentHand, tableCards, so it will be totally another program

  • Custom User Avatar

    Sorry, English isn't my native, i can mistake with it.

    First suggest was add reference for poker rules (link on wiki or rules description) on details becouse there are many kinds of poker (i was try some of them but only third was correct).
    And second was create new kata about Tehas Hold'em Poker, i will solve it with pleasure because it will be harder that this one)

  • Custom User Avatar

    This comment is hidden because it contains spoiler information about the solution

  • Custom User Avatar

    Which max memory can be used in program on C#?
    My one use 20 Mb (that says me VS) and always throw me an error that "Submission timed out while communicating with our servers" or "Unknown error" with my solution, but test cases are working.

  • Custom User Avatar

    Thanks, it's totally clear now.

    P.S. my fault)

  • Custom User Avatar

    Please, help! I passed my test cases, but submit returns a mistake
    Expected: 222436
    But was: 274078

    I tried to find my mistake, but cannot. Next number that program may calculate when returned me a number - 223959 & 335938 that more then 222436. Algorythm, i think, is right. Have you any ideas?

  • Custom User Avatar

    Maybe I don't understand this request, but in the 8330475 test you stay 24^2 as last number, but 24^2 = 529. And if we try to get sum of all the numbers in 2nd power, it will be only 4899. So, we can bring more numbers in our array. My program returned me this https://pp.vk.me/c627225/v627225407/302e1/qLl2USt4Zok.jpg . And, if i try to get sum of this it will be exactly 8330475. All the k[n] is maximized and more, than 1. It should be right, but....
    I don't understand this.

  • Custom User Avatar

    This comment is hidden because it contains spoiler information about the solution

  • Custom User Avatar

    This comment is hidden because it contains spoiler information about the solution

  • Custom User Avatar

    Thx, already found a mistake!

  • Custom User Avatar

    This comment is hidden because it contains spoiler information about the solution