Project Euler 006 Sum square difference

题意：$\sum_{i = 1} ^ {100}i^2 - (\sum _ {i = 1} ^ {100}i)^2$
分析：依旧考虑两种做法。
1. 暴力求出两个值。
2. 前一个等于$\frac{n(n + 1)(2n + 1)}{6}$，后一个等于$\left(\frac{n(n + 1)}{2}\right)^2$。

#include <bits/stdc++.h>

#define ll long long

#define pii std::pair<int,int>
#define mp std::make_pair
#define fi first
#define se second

#define SZ(x) (int)(x).size()
#define pb push_back

template<class T>inline void chkmax(T &x, const T &y) {if(x < y) x = y;}
template<class T>inline void chkmin(T &x, const T &y) {if(x > y) x = y;}

template<class T>
inline void read(T &x) {
    char c;int f = 1;x = 0;
    while(((c=getchar()) < '0' || c > '9') && c != '-');
    if(c == '-') f = -1;else x = c-'0';
    while((c=getchar()) >= '0' && c <= '9') x = x*10+c-'0';
    x *= f;
}
static int outn;
static char out[(int)2e7];
template<class T>
inline void write(T x) {
    if(x < 0) out[outn++] = '-', x = -x;
    if(x) {
        static int tmpn;
        static char tmp[20];
        tmpn = 0;
        while(x) tmp[tmpn++] = x%10+'0', x /= 10;
        while(tmpn) out[outn++] = tmp[--tmpn];
    }
    else out[outn++] = '0';
}

int c1(int n) {
    return n * (n + 1) * (2 * n + 1) / 6;
}

int c2(int n) {
    return n * n * (n + 1) * (n + 1) / 4;
}

int main() {
    printf("%d\n", c2(100) - c1(100));
    return 0;
}