Submission #1518898

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void){
    int n,m;
    cin>>n>>m;
    int a[m],b[m],c[n+1][n+1]={0},ans[n+1][n+1]={0},cnt[n+1]={0};
    for(int i=0;i<m;i++){
        cin>>a[i]>>b[i];
        c[a[i]][b[i]]++;
        c[b[i]][a[i]]++;
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(i==j) continue;
            if(c[i][j]==1) continue;
            for(int k=1;k<=n;k++){
                if(k==i||k==j) continue;
                ans[i][j]=c[k][i]*c[j][k];
                if(ans[i][j]) break;
            }
            cnt[i]+=ans[i][j];
        }
    }
    for(int i=1;i<=n;i++){
        cout<<cnt[i]<<endl;
    }
    return 0;
}

Submission Info

Judge Result