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.
  • Hackerrank Home
  • Prepare
    NEW
  • Certify
  • Compete
  • Career Fair
  • Hiring developers?
  1. All Contests
  2. ProjectEuler+
  3. Project Euler #113: Non-bouncy numbers
  4. Discussions

Project Euler #113: Non-bouncy numbers

Problem
Submissions
Leaderboard
Discussions

Sort 16 Discussions, By:

recency

Please Login in order to post a comment

  • pranavvinchurkar
    3 years ago+ 1 comment

    I arrived at the formula (k+9)C9+(k+10)C10 - 10*k - 2 non bouncy numbers less than 10^k using pen and paper. (combinatorics)

    Also number of increasing and decreasing non bouncy numbers won't be the same, some people might make that mistake.

    0|
    Permalink
  • padeff
    4 years ago+ 0 comments

    Seriously, putting two times the same number... just so you know for the ones that come after.

    0|
    Permalink
  • deepaksati719
    4 years ago+ 0 comments

    Terminated due to timeout What does this mean???

    Input (stdin) 3 3 5 10

    Your Output (stdout) 474 4953

    Expected Output 474 4953 277032

    Compiler Message

    Terminated due to timeout

    0|
    Permalink
  • rockstarsam1234
    4 years ago+ 0 comments

    Can it be solved using digit dp? Means states will be like: dp[N][last]=summation(dp[N-1][i]) for all i>=last for increasing? I tried this but its counting lesser no of increasing and decreasing numbers. Can anyone explain whats wrong?

    0|
    Permalink
  • thigwyd
    5 years ago+ 0 comments

    By the definitions given, the number 4444 is trivially both increasing and decreasing and thus not bouncy, correct?

    0|
    Permalink
Load more conversations

Need Help?


View top submissions
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy
  • Request a Feature