ZOJ 3212 K-Nice

最新推荐文章于 2024-07-11 16:04:12 发布

原创最新推荐文章于 2024-07-11 16:04:12 发布 · 779 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

zoj 专栏收录该内容

28 篇文章

订阅专栏

本文介绍了一道关于构造K-Nice矩阵的问题及其简单解法。K-Nice矩阵是指一个矩阵中恰好有k个内部元素等于其四个相邻元素之和。文章提供了输入输出样例及C++代码实现。

K-Nice

Time Limit: 1 Second Memory Limit: 32768 KB Special Judge

This is a super simple problem. The description is simple, the solution is simple. If you believe so, just read it on. Or if you don't, just pretend that you can't see this one.

We say an element is inside a matrix if it has four neighboring elements in the matrix (Those at the corner have two and on the edge have three). An element inside a matrix is called "nice" when its value equals the sum of its four neighbors. A matrix is called "k-nice" if and only if k of the elements inside the matrix are "nice".

Now given the size of the matrix and the value of k, you are to output any one of the "k-nice" matrix of the given size. It is guaranteed that there is always a solution to every test case.

Input

The first line of the input contains an integer T (1 <= T <= 8500) followed by T test cases. Each case contains three integers n, m, k (2 <= n, m <= 15, 0 <= k <= (n - 2) * (m - 2)) indicating the matrix size n * m and it the "nice"-degree k.

Output

For each test case, output a matrix with n lines each containing m elements separated by a space (no extra space at the end of the line). The absolute value of the elements in the matrix should not be greater than 10000.

Sample Input

2
4 5 3
5 5 3

Sample Output

#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
#include <math.h>
#include <stdio.h>

using namespace std;
int n,m,k;
int a[20][20];
int dir[4][2]={{0,1},{0,-1},{1,0},{-1,0}};
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d",&n,&m,&k);
        int p=1;int q=1;
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<m;j++)
            {
                a[i][j]=1;
            }
        }
        for(int i=1;i<=k;i++)
        {
            a[p][q]=0;
            for(int k=0;k<4;k++)
            {
                a[p+dir[k][0]][q+dir[k][1]]=0;
            }
            if(q==m-2)
            {
                p++;
                q=1;
            }
            else
            {
                q++;
            }
        }
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<m;j++)
            {
                if(j!=m-1)
                    printf("%d ",a[i][j]);
                else
                    printf("%d\n",a[i][j]);
            }
        }
    }
    return 0;
}