Submission #698787

#TimeUsernameProblemLanguageResultExecution timeMemory
698787vjudge1Duathlon (APIO18_duathlon)C++17
0 / 100
20 ms320 KiB
#include <bits/stdc++.h>
#define endl '\n'
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int ll
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
using namespace std;
const int N = 1e3 + 10, mod = 1e9 + 7;

signed main()
{
    FAST;
    int n, m;
    cin >> n >> m;
    for(int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
    }
    if(n == 1) {
        cout << 0 << endl;
        return 0;
    }
    if(n == 2) {
        cout << 0 << endl;
        return 0;
    }
    int ans = 0;
    for(int i = 1; i <= n - 2; i++) {
        int a = n - i - 1;
        ans += a * (a + 1) / 2;
    }
    cout << ans * 2 << endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...