ZOJ 3212 K-Nice【】
来源:互联网 发布:匡恩网络是个奇葩公司 编辑:程序博客网 时间:2024/05/01 18:55
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
#include<cstdio>#include<math.h>#include<cstring>#include<climits>#include<string>#include<queue>#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<climits>#include<string>#include<queue>#include<stack>#include<set>#include<map>#include<algorithm>using namespace std;#define rep(i,j,k)for(i=j;i<k;i++)#define per(i,j,k)for(i=j;i>k;i--)#define MS(x,y)memset(x,y,sizeof(x))#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1#define ll long long#define abs(x) (x>0?x:-x)const int INF=0x7ffffff;const ll MAX=1e18;int i,j,k,n,m;int main(){ int T; scanf("%d",&T); while(T--){ scanf("%d%d%d",&n,&m,&k); k=(n-2)*(m-2)-k; for(i=0;i<n;i++){ printf("%d",0); for(j=0;j<m-2;j++){ if(k>0) printf(" %d",k--); else printf(" %d",0); } printf(" %d\n",0); } } return 0;}
- 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 解题报告
- 【城会玩系列】ZOJ 3212 K-Nice【思维】
- ZOJ 3212 K-Nice(思维)
- ZOJ-3212-K-Nice【6th浙江省赛】【构造】
- ZOJ3206 Disaster Area Reconstruction ZOJ 3211 Dream City ZOJ 3212 K-Nice
- K-Nice
- K-Nice
- ZOJ3212-K-Nice
- ZOJ 3212(K)
- ZOJ-2317 Nice Patterns Strike Back
- Mysql的索引和慢查询优化
- Android各个版本名称与版本号对照表
- Android酷炫实用的开源框架(UI框架)
- JDBC 连接步骤
- Linux链接库三(C跟C++之间动态库的相互调用)
- ZOJ 3212 K-Nice【】
- 线程1
- Flink运行时之批处理程序生成计划
- java网络编程
- 状态栏颜色设置
- android中expandablelistview放在viewpager中不显示
- Android 友盟分享详细集成过程及所遇问题解决
- ReactNative-打包发布APK
- 微信公众号开发模板消息推送(三) java