Submission #72690926

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

using LL = long long;

#define int long long

const int N = 2e5 + 1;
const int M = 998244353;

void solve()
{
    int n, m;
    cin >> n >> m;
    vector<int> a(m + 1);
    vector<int> b(m + 1);

    map<int, int> mp;
    auto C = [&](LL n, LL m)
    {
        if (m < 0 || n - m < 0)
            return 0LL;
        LL res = 1;
        for (LL i = 1; i <= m; ++i)
        {
            res = res * ((n - m + i)) / i;
        }
        return res;
    };
    for (int i = 1; i <= m; i++)
    {
        cin >> a[i] >> b[i];
        mp[a[i]]++;
        mp[b[i]]++;
    }
    for (int i = 1; i <= n; i++)
    {
        cout << C(n - 1 - mp[i], 3) << ' ';
    }
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    //   cin >> T;

    while (T--)
        solve();

    return 0;
}

Submission Info

Judge Result