Submission #72706179

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vec vector
#define pll pair<ll,ll>
const ll N = 2e5 + 50;

vec<ll> G[N];

ll cal(ll n){
	ll ans = n * (n - 1) * (n - 2);
	return ans / 6;
}

void solve(){
	ll n,m;cin >> n >> m;
	while(m--){
		ll u,v;cin >> u >> v;
		G[u].push_back(v);
		G[v].push_back(u);
	}
	for(int i = 1 ; i <= n ; i++){
		ll c = n - (G[i].size() + 1);
//		cout << c << "*" << G[i].size() << "\n";
		if(c >= 3) cout << cal(c) << " ";
		else cout << 0 << " ";	
	}
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);cout.tie(nullptr);
	int T = 1;
//	cin >> T;
	while(T--){
		solve();
	}
    return 0;
}

Submission Info

Judge Result