Submission #1530436

---

Source Code Expand

#include <iostream>
#include <vector>
#include <queue>
#include <sstream>
#include <algorithm>
#include <bitset>
#include <limits>
#include <map>
#include <set>
#include <iomanip>
#include <cmath>

using namespace std;

typedef long long int ll;
typedef std::numeric_limits<double> dbl;
const long long int LL_INF=1LL<<60;

vector<string> split(const string& input, char delimiter)
{
    stringstream stream(input);
    
    string field;
    vector<string> result;
    while (getline(stream, field, delimiter)) {
        result.push_back(field);
    }
    return result;
}

//#define DEBUG

ll A, B, M, N, D, K, Q, W, H, T, X, Y;

int main()
{
    cin >> N >> M;
    vector<int> nums(N);
    for (int i = 0; i < M; ++i) {
        int a,b; cin >> a >> b;
        if (a != b) {
            nums[a-1]++; nums[b-1]++;
        }
    }

    for (auto n : nums) cout << n << endl;

    return 0;
}

Submission Info

Judge Result