Napoleon2004的博客

#include<cstdio> #include<cstring> using namespace std; bool used[510]; int n,m,ans,girl[510],a[510][510]; int find(int x){ int i,j; for(j=1;j<=n;j++) if(a[x][j]&&used[j]==0...

Given an N*N matrix with each entry equal to 0 or 1. You can swap any two rows or any two columns. Can you find a way to make all the diagonal entries equal to 1? Input There are seve...