zoukankan      html  css  js  c++  java
  • zoj 3212 K-Nice(构造)

    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 nmk (2 <= nm <= 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

    2 1 3 1 1
    4 8 2 6 1
    1 1 9 2 9
    2 2 4 4 3
    0 1 2 3 0
    0 4 5 6 0
    0 0 0 0 0
    0 0 0 0 0
    0 0 0 0 0

    #include <iostream>
    #include<cstdio>
    #include<cstring>
    using namespace std;
    int t,n,m,k;
    int mp[20][20];
    int main()
    {
        while(~scanf("%d",&t))
        {
         for(;t>0;t--)
         {
             scanf("%d%d%d",&n,&m,&k);
             k=(n-2)*(m-2)-k;
             for(int i=1;i<=n;i++)
             {
                 printf("0");
                 for(int j=2;j<m;j++)
                    if (k>0) printf(" %d",k--);
                     else printf(" 0");
                printf(" 0
    ");
             }
         }
        }
        return 0;
    }
  • 相关阅读:
    oracle之修改/忘记用户密码
    linux 使用错误总结
    oracle数据库之用户管理
    linux命令使用总结
    linux各种压缩包的压缩和解压方法
    logback将日志写入不同文件夹里
    nginx下配置多个web服务
    OKHttp3学习
    linux 发送 post 请求
    maven 项目下 Maven Dependencies 下列表为空
  • 原文地址:https://www.cnblogs.com/stepping/p/6401193.html
Copyright © 2011-2022 走看看