题意:让你用1-n*n这些数填充n*n矩阵,要求每行的数字严格递增、每个数字只能用一次且保证第k列的数字和最大。
思路:贪心选数,随便搞搞就过了。
AC代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <string>
#define INF 1000000
#define eps 1e-8
#define MAXN (100000+10)
#define MAXM (10000+10)
#define Ri(a) scanf("%d", &a)
#define Rl(a) scanf("%lld", &a)
#define Rf(a) scanf("%lf", &a)
#define Rs(a) scanf("%s", a)
#define Pi(a) printf("%d\n", (a))
#define Pf(a) printf("%.2lf\n", (a))
#define Pl(a) printf("%lld\n", (a))
#define Ps(a) printf("%s\n", (a))
#define W(a) while((a)--)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define LL long long
#define lson o<<1, l, mid
#define rson o<<1|1, mid+1, r
#define ll o<<1
#define rr o<<1|1
#define PI acos(-1.0)
#pragma comment(linker, "/STACK:102400000,102400000")
#define fi first
#define se second
using namespace std;
typedef pair<int, int> pii;
int Map[600][600];
int main()
{
int n, k;
Ri(n); Ri(k); int Max = n * n;
int Min = 1;
for(int i = 1; i <= n; i++)
{
Max -= (n - k);
Map[i][k] = Max;
for(int j = k+1; j <= n; j++)
Map[i][j] = Map[i][j-1] + 1;
for(int j = 1; j < k; j++)
Map[i][j] = Min++;
Max--;
}
int sum = 0;
for(int i = 1; i <= n; i++) sum += Map[i][k];
Pi(sum);
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
if(j > 1) printf(" ");
printf("%d", Map[i][j]);
}
printf("\n");
}
return 0;
}