Submission #1367860

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define pb(a) push_back(a)
#define rd(a) cin>>(a)
#define RD(a,b) cin>>(a)>>(b)
#define pr(a) cout<<(a)<<endl
#define PR(a,b) cout<<(a)<<" "<<(b)<<endl
#define F first
#define S second
#define ll long long
bool check(int n,int m,int x,int y){return (x<0||x>=n||y<0||y>=m)?false:true;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};
typedef pair<int,int> P;
 
int main() {
  int n,m;
  RD(n,m);
  vector<int> v[n+1];
  rep(i,m) {
    int x,y;
    cin >> x >> y;
    v[x].pb(y);
    v[y].pb(x);
  }
  REP(k,1,n+1) {
    int ans=0;
    bool a[n+1];
    fill(a,a+n+1,false);
    a[k]=true;
    rep(i,v[k].size()) a[v[k][i]]=true;
    rep(i,v[k].size()) {
      int x=v[k][i];
      rep(j,v[x].size()) {
	if(!a[v[x][j]]) {
	  ans++;
	  a[v[x][j]]=true;
	}
      }
    }
    pr(ans);
  }
  return 0;
}

Submission Info

Judge Result