Project Euler #6: Sum square difference Discussions |

Sort by

recency

|

276 Discussions

|

1 month ago+ 0 comments

Haskell

import Control.Applicative
import Control.Monad
import System.IO


sqSumTo :: Int -> Int
sqSumTo n = ((n * (n+1)) `div` 2 ) ^ 2

sumSqTo :: Int -> Int
sumSqTo n = sum [x * x | x <- [1..n]]

main :: IO ()
main = do
    t_temp <- getLine
    let t = read t_temp :: Int
    forM_ [1..t] $ \a0  -> do
        n_temp <- getLine
        let n = read n_temp :: Int
        print (sqSumTo n - sumSqTo n)

4 months ago+ 0 comments

Kotlin 100% - Use long for the last testcase.

private fun sumOfSquares(input: Long, sum: Long): Long{
    return if(input == 0L) sum else  sumOfSquares(input - 1, sum+(input*input))
}

private fun sumOfNumbers(input: Long):Long{
    return (input * (input+1))/2
}

7 months ago+ 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)) )

8 months ago+ 0 comments

t = int(input().strip())
for a0 in range(t):
    n = int(input().strip())
    
    sumofsquare = (n*(n+1)//2)**2 
    squareofsum = n*(n+1)*(2*n+1) // 6 
    print(abs(sumofsquare-squareofsum))

8 months ago+ 0 comments

why my second case isn't executed? for(int a0 = 0; a0 < t; a0++){ int n; cin >> n; int sum=0; int sqsum=0; int sqaure;

    for(int i=1;i<=n;i++){
         sum+=i;
         sqaure =pow(sum,2);
         sqsum+=pow(i,2);
    }
    int diff=sqaure-sqsum;
     cout<<diff<<endl;
}

Sort by

|

276 Discussions

|

Cookie support is required to access HackerRank

Please signup or login in order to view this challenge