Submission #1369866

---

Source Code Expand

#include <cstdio>
#include <algorithm>
#include <iostream>
#include <vector>
#include <set>
using namespace std;
int N,M;
int G[11][11];
int main(){
  cin >> N >> M;
  for(int i=0;i<M;i++){
    int a,b;
    cin >> a >> b;
    a--;b--;
    G[a][b]=1;
    G[b][a]=1;
  }
  for(int i=0;i<N;i++){
    set <int> s;
    //int ans=0;
    for(int j=0;j<N;j++){
      if(G[i][j]==0)continue;
      for(int k=0;k<N;k++){
	if(k==i)continue;
	if(G[j][k]==1 && G[i][k]==0)s.insert(k);//ans++;
      }
    }
    cout << s.size() << endl;
  }
  
  return 0;
}

Submission Info

Judge Result