HDU 1498 50 years, 50 colors

#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;#define size 110int map[size][size],use[size],vis[size],ans[size],k,n,match[size];int find(int u,int color){int i,j;for(i=1;i<=n;i++){if(!vis[i]&&map[u][i]==color){vis[i]=1;if(match[i]==-1||find(match[i],color)){match[i]=u;return 1;}}}return 0;}int hungary(int color){int i,sum=0;for(i=1;i<=n;i++){memset(vis,0,sizeof(vis));sum+=find(i,color);}return sum;}int main(){int i,j;while(scanf("%d%d",&n,&k),n+k){memset(map,0,sizeof(map));memset(use,0,sizeof(use));for(i=1;i<=n;i++)for(j=1;j<=n;j++)scanf("%d",&map[i][j]);int num=0;for(i=1;i<=n;i++)for(j=1;j<=n;j++){int sum=0;if(!use[map[i][j]]){memset(match,-1,sizeof(match));use[map[i][j]]=1;if(hungary(map[i][j])>k)ans[num++]=map[i][j];}}if(!num){printf("-1\n");continue;}sort(ans,ans+num);for(i=0;i<num-1;i++)printf("%d ",ans[i]);printf("%d\n",ans[num-1]);}return 0;}