Submission #1678609

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;
int n,m;
bool use[11];
vector<int>g[11];
int main() {
  cin >> n >> m;

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

 
  for(int i = 0; i < n; i++) {
    fill(use,use+n,false);
    queue<int> q;
    int ans = 0;
    use[i] = true;
    for(int j = 0; j < g[i].size(); j++) {
      q.push(g[i][j]);
      use[g[i][j]] = true;
    }
    while(!q.empty()) {
      int t = q.front(); q.pop();
      for(int k = 0; k < g[t].size(); k++) {
	if(!use[g[t][k]]) {
	  ans++;
	  use[g[t][k]] = true;
	}
      }
    }
    cout << ans <<endl;
  }
}
	  

Submission Info

Judge Result