Submission #1678586

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <cassert>
#include <cinttypes>

#define fi first
#define se second

using namespace std;

typedef int64_t ll;
typedef uint64_t ull;

const int INF = 1e9;
const double EPS = 1e-9;

typedef pair<int, int> P;
inline P operator+(const P& p1, const P& p2) {
  return P(p1.first + p2.first, p1.second + p2.second);
}

int N, M;
vector<int> G[11];

void Solve(int v, int d, int dist[12]) {
  if (d == 2) {
    return;
  }
  for (auto u : G[v]) {
    if (dist[u] > d + 1) {
      dist[u] = d + 1;
      Solve(u, d + 1, dist);
    }
  }
}

int main() {
  cin >> N >> M;
  for (int i = 0; i < M; i++) {
    int A, B;
    cin >> A >> B;
    G[A].push_back(B);
    G[B].push_back(A);
  }

  for (int i = 1; i <= N; i++) {
    int dist[12];
    for (int j = 0; j < 12; j++) {
      dist[j] = INF;
    }
    dist[i] = 0;
    Solve(i, 0, dist);
    int ans = 0;
    for (int j = 1; j <= N; j++) {
      if (dist[j] == 2) {
        ans++;
      }
    }
    cout << ans << endl;
  }
  
  return 0;
}

Submission Info

Judge Result