Submission #4073343

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<complex>
#include<string.h>
using namespace std;
typedef long long int llint;
int main(){
	int n, m;
	cin >> n >> m;
	vector<pair<int,int>>a(m);
	for (int i = 0; i < m; i++){
		cin >> a[i].first >> a[i].second;
	}
	vector<int>ans(n, 0);
	for (int i = 0; i < n; i++){
		for (int j = 0; j < m; j++){
			if (a[j].first == i + 1 || a[j].second == i + 1){
				ans[i]++;
			}
		}
	}
	for (int i = 0; i < n; i++){
		cout << ans[i] << endl;
	}
	return 0;
}

Submission Info

Judge Result