CF 342div2 C 贪心

题目连接

http://codeforces.com/contest/625/problem/C

Description

People do many crazy things to stand out in a crowd. Some of them dance, some learn by heart rules of Russian language, some try to become an outstanding competitive programmers, while others collect funny math objects.

Alis is among these collectors. Right now she wants to get one of k-special tables. In case you forget, the table n × n is called k-special if the following three conditions are satisfied:

every integer from 1 to n2 appears in the table exactly once;
in each row numbers are situated in increasing order;
the sum of numbers in the k-th column is maximum possible.

Your goal is to help Alice and find at least one k-special table of size n × n. Both rows and columns are numbered from 1 to n, with rows numbered from top to bottom and columns numbered from left to right.

Input

The first line of the input contains two integers n and k (1 ≤ n ≤ 500, 1 ≤ k ≤ n) — the size of the table Alice is looking for and the column that should have maximum possible sum.

Output

First print the sum of the integers in the k-th column of the required table.

Next n lines should contain the description of the table itself: first line should contains n elements of the first row, second line should contain n elements of the second row and so on.

If there are multiple suitable table, you are allowed to print any.

Input

The first line of the input contains two integers n and k (1 ≤ n ≤ 500, 1 ≤ k ≤ n) — the size of the table Alice is looking for and the column that should have maximum possible sum.

Output

First print the sum of the integers in the k-th column of the required table.

Next n lines should contain the description of the table itself: first line should contains n elements of the first row, second line should contain n elements of the second row and so on.

If there are multiple suitable table, you are allowed to print any.

Sample Input

4 1

Sample Output

28

1 2 3 4

5 6 7 8

9 10 11 12

13 14 15 16

题意

给出数n,用n*n个数构造一个数组，该数组的每一行都是升序，并使给定的某一列上的数的和最大

题解

贪心就好，从右往左，一次打印从大往小的书，以给定的特殊列为界，先打右边的一部分表，然后打左边的那剩下的部分

代码

#include<bits/stdc++.h>
using namespace std;
int a[505][505];
int main(int argc, char const *argv[])

{
int n,k;
cin>>n>>k;
int m=n*n;
int ans=0;
for (int i = 0; i < n; ++i)
{
for (int j = n-1; j >=k-1 ; --j)
{
a[i][j]=m--;
}
ans+=m+1;
}
for (int i = 0; i < n; ++i)
{
for (int j = k-2; j>=0; --j)
{
a[i][j]=m--;
}
}
printf("%d\n",ans );
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
printf("%d ",a[i][j] );
}
printf("\n");
}
return 0;
}