Friends-of-Friends - set

#include <iostream>
#include <vector>
#include <set>
#include <algorithm>

using namespace std;

int n, m;
vector<int> v[105];

int getans(int x) {
    set<int> s;

    for (int y : v[x])
        for (int z : v[y])
            s.insert(z);

    for (int y : v[x])
        s.erase(y);
    s.erase(x);

    return s.size();
}

int main() {
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        a--;
        b--;
        v[a].push_back(b);
        v[b].push_back(a);
    }

    for (int i = 0; i < n; i++)
        cout << getans(i) << endl;
}