ZOJ 3212 K-Nice(思维)
来源:互联网 发布:淘宝众筹赚钱吗 编辑:程序博客网 时间:2024/05/23 02:04
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
24 5 35 5 3
Sample Output
2 1 3 1 14 8 2 6 11 1 9 2 92 2 4 4 30 1 2 3 00 4 5 6 00 0 0 0 00 0 0 0 00 0 0 0 0
Author: ZHUANG, Junyuan
Source: The 6th Zhejiang Provincial Collegiate Programming Contest
题意:若一个数等于其相邻四数加和,我们就称它为nice数,现要求我们构建一个n*m的矩阵,其中恰好有n个nice数。
#include<bits/stdc++.h>using namespace std;int a[20][20];int main(){ int t; scanf("%d",&t); int n,m,k; while(t--) { scanf("%d%d%d",&n,&m,&k); memset(a,0,sizeof(a)); int cnt=1,flag=0; k=(m-2)*(n-2)-k; for(int i=0;i<n-1;i++) { for(int j=1;j<m-1;j++) { if(cnt<=k) { a[i][j]=cnt++; } else flag=1; } if(flag) break; } for(int i=0;i<n;i++) { for(int j=0;j<m;j++) { printf("%d%c",a[i][j],j<m-1?' ':'\n'); } } }}
- ZOJ 3212 K-Nice(思维)
- 【城会玩系列】ZOJ 3212 K-Nice【思维】
- ZOJ - 3212 K-Nice
- zoj 3212 K-Nice
- ZOJ 3212 K-Nice
- ZOJ 3212 K-Nice
- ZOJ 3212 K-Nice【】
- ZOJ 3212 K-Nice
- zoj 3212 K-Nice(数学题)
- ZOJ 3212K-Nice(构造)
- zoj 3212 K-Nice 解题报告
- ZOJ-3212-K-Nice【6th浙江省赛】【构造】
- ZOJ3206 Disaster Area Reconstruction ZOJ 3211 Dream City ZOJ 3212 K-Nice
- ZOJ 3212(K)
- K-Nice
- K-Nice
- ZOJ 3872 (思维)
- ZOJ 3328(思维)
- XML实现AOP
- 水模拟
- 特征匹配中的欧氏距离
- ubuntu16.04——WingIDE安装
- OpenStack tempest安装与运行测试
- ZOJ 3212 K-Nice(思维)
- YOLO论文学习笔记
- MongoDB 3.2版本常用代码全整理(3)
- JAVA初学:完成1到n的阶乘(利用BigIntger)
- iOS开发中访问并修改一个类的私有属性
- 机器学习实战+统计学习方法之理解KNN(1.实战代码的详细走读和解析)
- 用php面向对象实现文件上传
- HDU 1166 敌兵布阵 (线段树点更新模板题)
- 参考书籍