【CodeForces 803A】Maximal Binary Matrix（模拟）

A. Maximal Binary Matrix

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given matrix with n rows and n columns filled with zeroes. You should put k ones in it in such a way that the resulting matrix is symmetrical with respect to the main diagonal (the diagonal that goes from the top left to the bottom right corner) and is lexicographically maximal.

One matrix is lexicographically greater than the other if the first different number in the first different row from the top in the first matrix is greater than the corresponding number in the second one.

If there exists no such matrix then output -1.

Input

The first line consists of two numbers n and k (1 ≤ n ≤ 100, 0 ≤ k ≤ 10⁶).

Output

If the answer exists then output resulting matrix. Otherwise output -1.

Examples

input

2 1

output

1 0 0 0 

input

3 2

output

1 0 0 0 1 0 0 0 0 

input

2 5

output

-1

题目大意：给一个n*n的0矩阵，在矩阵中加入k个1，使矩阵为对称矩阵，并且从上到下从左到右都是最大的

思路：将矩阵分为上三角和下三角，在上三角依次从左到右从上到下填，同时将对称位置变为1，模拟

#include <bits/stdc++.h>using namespace std;int n,k;int a[105][105];int main(){    while(~scanf("%d%d",&n,&k)){        if (k > n*n) {            printf("-1\n");            continue;        }        for (int i=0; i<n; i++){            for (int j=i; j<n; j++){                if (k==0) break;                if (i==j){                    a[i][j]=1;                    k--;                }                else {                    if (k==1) continue;                    a[i][j]=a[j][i]=1;                    k-=2;                }            }            if (k==0) break;        }        for (int i=0; i<n; i++){            for (int j=0; j<n-1; j++)                printf("%d ",a[i][j]);            printf("%d\n",a[i][n-1]);        }    }    return 0;}