codeforces #342 div 2 C. K-special Tables

http://codeforces.com/contest/625/problem/C 题意:构造一个矩阵。。满足三个条件。。。 思路:简单构造。。。看代码把。。。。

 1/* ***********************************************
 2Author :111qqz
 3Created Time :2016年02月07日 星期日 17时49分15秒
 4File Name :code/cf/#342/C.cpp
 5************************************************ */
 6
 7#include <cstdio>
 8#include <cstring>
 9#include <iostream>
10#include <algorithm>
11#include <vector>
12#include <queue>
13#include <set>
14#include <map>
15#include <string>
16#include <cmath>
17#include <cstdlib>
18#include <ctime>
19#define fst first
20#define sec second
21#define lson l,m,rt<<1
22#define rson m+1,r,rt<<1|1
23#define ms(a,x) memset(a,x,sizeof(a))
24typedef long long LL;
25#define pi pair < int ,int >
26#define MP make_pair
27
28using namespace std;
29const double eps = 1E-8;
30const int dx4[4]={1,0,0,-1};
31const int dy4[4]={0,-1,1,0};
32const int inf = 0x3f3f3f3f;
33const int N=5E2+7;
34
35int n;
36int k;
37int ans[N][N];
38int main()
39{
40	#ifndef  ONLINE_JUDGE 
41	freopen("code/in.txt","r",stdin);
42  #endif
43
44	cin>>n>>k;
45	int cnt = 0;
46	ms(ans,0);
47	for ( int i = 1 ; i <= n ; i++)
48	    for ( int j = 1 ; j <= k-1 ; j++)
49	    {
50		cnt++;
51		ans[i][j] = cnt;
52	    }
53	for ( int i = 1 ; i <= n  ;i++)
54	    for ( int j = k ; j <=n  ;j++)
55	    {
56		cnt++;
57		ans[i][j]=cnt;
58	    }
59	int sum = 0 ;
60//	cout<<"k:"<<k<<endl;
61	for ( int i = 1 ; i <= n ; i++)
62	{
63	    sum +=ans[i][k];
64
65	   // cout<<"sum:"<<sum<<endl;
66	}
67
68	cout<<sum<<endl;
69	for ( int i = 1 ; i <= n ; i++)
70	{
71	    for ( int j = 1 ; j <= n-1 ; j++)
72	    {
73		printf("%d ",ans[i][j]);
74	    }
75	    printf("%d\n",ans[i][n]);
76	}
77
78  #ifndef ONLINE_JUDGE  
79  fclose(stdin);
80  #endif
81    return 0;
82}