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. All Contests
  2. ProjectEuler+
  3. Project Euler #215: Crack-free Walls
  4. Discussions

Project Euler #215: Crack-free Walls

Sort by

recency

|

13 Discussions

|

  • DonFr
     + 0 comments

    hackerrank should update C# to the latest language level. There are features past C#7 that can help solve this problem within the time constraints.

  • levpolka
     + 0 comments

    I found this problem. In original you must find the answer with given input (32, 10), and it is just back to back with time complexity, O(num_of_vars^2). But here we have stricter requirements. So, can you share an idea of how to solve it?

  • ayrton_mercado
     + 0 comments

    This link lists the environments used for running solutions. Do these apply to contests as well? (I assume so, but would like to confirm either way)

    https://www.hackerrank.com/environment

  • Niharikasaitana
     + 0 comments

    can anyone pls explain me the qustion

  • dixitsandeep
     + 0 comments

    what is criteria for difference in ranking when score is equal? Why not differentiate in score itself?