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 #156: Counting Digits
  4. Discussions

Project Euler #156: Counting Digits

Problem
Submissions
Leaderboard
Discussions

Sort 7 Discussions, By:

recency

Please Login in order to post a comment

  • avi_ganguly94
    6 years ago+ 0 comments

    bayleef needs to spend time trying to get his explainations better

    0|
    Permalink
  • karthi_14T118
    6 years ago+ 0 comments

    f(n,1) could any one explain this

    -1|
    Permalink
  • singh15628
    6 years ago+ 1 comment

    Can anyone tell what the excatly function f(n,d) is ?

    0|
    Permalink
  • shamas
    6 years ago+ 1 comment

    Let s(d) be the sum of all the solutions for which f(n,d) = n.

    Does this mean that s(d) is the total number of solutions, or it is the summation of the number n for which the statement is true? The example in the instructions doesn't help clarify this...

    -1|
    Permalink
  • vihisharal826
    6 years ago+ 0 comments

    I am not able to get problem exactely. Can any one Around Here Who tell about problem statement clear to me just explain the problem not the solution.

    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