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 #142: Perfect Square Collection
  4. Discussions

Project Euler #142: Perfect Square Collection

Sort by

recency

|

13 Discussions

|

  • siripallakonda11
     + 0 comments

    can u provide code for this question and explain the code brifely

  • vijay6_vit
     + 0 comments

    I am bit confused with the problem statements.

  • jbaum517
     + 0 comments

    Passed all test cases except #7 and #8.. Anybody have any tips about why this might be? To me my algorithm works when N>=3000, but apparently not?

    It's not a timeout issue as I'm returning answers fast.

  • thirumuscat
     + 1 comment

    error: no suitable method found for valueOf(BigInteger)

    for (BigInteger x =BigInteger.valueOf(1234567890);x.compareTo(BigInteger.ZERO) > 0;x=x.subtract(BigInteger.ONE)) { for (BigInteger y =BigInteger.valueOf(x);y.compareTo(BigInteger.ZERO) > 0;y = y.subtract(BigInteger.ONE)) { for (BigInteger z = BigInteger.valueOf(y); z.compareTo(BigInteger.ZERO) > 0; z = z.subtract(BigInteger.ONE))

    pls help!!!

  • cedricngoran1997
     + 1 comment

    can we use bisection search to find the numbers ?