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 #6: Sum square difference
  4. Discussions

Project Euler #6: Sum square difference

  • sir_bryan_chong
     + 0 comments

    Here's my solution:

    record = {1:1}
def sumOfFirstNNumbersSquared(n):
    if n in record:
        return record[n]
    else:
        record[n] = sumOfFirstNNumbersSquared(n - 1) + n ** 2
        return record[n]


t = int(input().strip())
for a0 in range(t):
    n = int(input().strip())
    
    a = ( n * (n + 1) / 2 ) ** 2
    b = sumOfFirstNNumbersSquared(n)
    print(int( abs(a - b)) )