站外题求助

#include<bits/stdc++.h>
using namespace std;

int d(int x,int y) 
{
    return __builtin_popcount(x^y);
}

int main() 
{
	freopen("hamming.in","r",stdin);
	freopen("hamming.out","w",stdout);
    int n,m;
    scanf("%d%d",&n,&m);
    int a[n];

    for(int i=0;i<n;i++)
        scanf("%d",&a[i]);
	int ma;
    for(int i=0;i<n;i++) 
	{
        ma=0;
        for(int j=0;j<n;j++)
            if(i!=j)
                ma=(d(a[i],a[j])>ma)?(d(a[i],a[j])):ma;
        printf("%d%s",ma,(i==n-1?"":" "));
    }
}