Submission #1689372

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;

using ll = long long;
using P = pair<int, int>;

bool edge[11][11];
bool done[11];

int main() {
  // 入力
  int N, M;
  cin >> N >> M;
  int a, b;
  for (int i = 0; i < M; i++) {
    cin >> a >> b;
    a--; b--;
    edge[a][b] = edge[b][a] = true;
  }

  int ans;
  for (int i = 0; i < N; i++) {
    ans = 0;
    fill(done, done + N, false);
    for (int j = 0; j < N; j++) {
      if (i == j) continue;
      if (edge[i][j]) continue;
      for (int k = 0; k < N; k++) {
        if (i == k || j == k) continue;
        if (edge[i][k] && edge[j][k] && !done[j]) {
          done[j] = true;
          ans++;
        }
      }
    }
    cout << ans << endl;
  }

  return 0;
}

Submission Info

Judge Result