#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<algorithm>
#include<queue>
#include<list>
#include<stack>
#include<cstdio>
#include<fstream>
#include<numeric>
#include<functional>
#include<utility>
#include<memory>
using namespace std;
using namespace placeholders;
int main(){
int n, k;
while (cin >> n >> k){
if (k > 10000){
cout << "-1" << endl;
}
else{
vector<vector<int>> matrix(n, vector<int>(n, 0));
int row = 0;
while (k >0 && row<n){
int col = row;
matrix[row][col] = 1;
k--;
col++;
while (col < n&&k >= 2){
matrix[row][col] = 1;
k--;
matrix[col][row] = 1;
k--;
col++;
}
row++;
}
if (k == 0){
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++) cout << matrix[i][j] << " ";
cout << endl;
}
}
else{
cout << "-1" << endl;
}
}
}
return 0;
}
803A Maximal Binary Matrix
最新推荐文章于 2021-08-26 15:35:16 发布