ZOJ 3212K-Nice(构造)

来源：互联网发布：大数据分析师笔试内容编辑：程序博客网时间：2024/05/22 16:43

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3212

给出的范围是(n-2)*(m-2) 第二组样例也给出了提示，构造初始零矩阵，XJB构造保证有K个0是nice

#include<iostream>#include<cstdio>#include<set>#include<string>#include<string.h>#include<cstring>#include<vector>#include<map>#include<queue>#include<stack>#include<cctype>#include<algorithm>#include<sstream>#include<utility>#include<cmath>#define mt(a) memset(a,0,sizeof (a))#define fl(a,b,c) fill(a,b,c)#define SWAP(a,b,t) (t=a,a=b,b=t)#define inf 1000000000+7using namespace std;typedef long long ll;int M[20][20];int main(){int T;cin >> T;while (T--){mt(M);int n, m, k;scanf("%d %d %d", &n, &m, &k);int temp = 1;k = ((n - 2)*(m - 2) - k);for (int i = 0; i < n ; i++){for (int j = 1; j < m - 1; j++){if (k){M[i][j] = temp++; k--;}}}for (int i = 0; i < n; i++){for (int j = 0; j < m; j++){if (j)printf(" ");printf("%d", M[i][j]);}printf("\n");}}return 0;}

0 0