【Codeforces 803 A】+ 构造

A. Maximal Binary Matrix
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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 ≤ 106).
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

从第一行，第一列开始构造就好

AC代码：

#include<cstdio>
#include<iostream>
using namespace std;
int a[120][120];
int main()
{
    int n,k;
    cin >> n >> k;
    if(n * n < k) puts("-1");
    else{
        for(int i = 0; i < n && k; i++){
            a[i][i] = 1;
            k--;
            int j = i + 1;
            while(j < n && k > 1)
                a[i][j] = a[j][i] = 1,k -= 2,j++;
        }
        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]);
        }
    }
}