Submission #2126137

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<ll, ll> P;
#define MOD (1000000007ll)
#define l_ength size

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

int main(void){
	int n,m,ans[55],i,a,b;
	fill(ans,ans+55,0);
	cin >> n >> m;
	for(i=0; i<m; ++i){
		cin >> a >> b;
		a--; b--;
		ans[a]++;
		ans[b]++;
	}
	for(i=0; i<n; ++i){
		cout << ans[i] << endl;
	}
	return 0;
}

Submission Info

Judge Result