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 #222: Sphere Packing
  4. Discussions

Project Euler #222: Sphere Packing

  • Kajalsahu0028
     + 1 comment

    hi can anyone please tell me what's wrong with this code cause it's not working after test case 2 import math

    import math
R,n = map(int,input().split())
r = list(map(int,input().split()))
dist = []
for i in range(n):
    if i!=n-1:
        d = r[i]+r[i+1]
        x = 2*R - d
        y = math.sqrt(d*d-x*x)
        dist.append(y)
height = sum(dist)+r[0]+r[len(r)-1]
print(round(height*1000))

    • davidsamuel
       + 0 comments

      You are following the sequence of balls given in the input cases. But you got to find the sequence of balls which gives you the shortest length and then evaluate.

Join us

Create a HackerRank account

Be part of a 26 million-strong community of developers

Already have an account?Log in