HackerRankEulerSolutions/SumSquareDifference.cpp at master · Pradyuman7/HackerRankEulerSolutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

long totalSquare(long n){
    long sum=0;
    for(long i=1;i<=n;i++)
        sum+=i;

    return sum*sum;
}

long allSquare(long n){
    long sum=0;
    for(long i=1;i<=n;i++)
        sum+=i*i;

    return sum;
}

int main(){
    int t;
    cin >> t;

    for(int i = 0; i < t; i++){
        long n,k,m;
        cin >> n;
        k = totalSquare(n);
        m = allSquare(n);
        cout<<k-m<<endl;
    }

    return 0;
}