codeforces #342 div 2 C. K-special Tables

2016-02-07 · 1 min read · 构造

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

/* ***********************************************
Author :111qqz
Created Time :2016年02月07日 星期日 17时49分15秒
File Name :code/cf/#342/C.cpp
************************************************ */

 1#include <cstdio>
 2#include <cstring>
 3#include <iostream>
 4#include <algorithm>
 5#include <vector>
 6#include <queue>
 7#include <set>
 8#include <map>
 9#include <string>
10#include <cmath>
11#include <cstdlib>
12#include <ctime>
13#define fst first
14#define sec second
15#define lson l,m,rt<<1
16#define rson m+1,r,rt<<1|1
17#define ms(a,x) memset(a,x,sizeof(a))
18typedef long long LL;
19#define pi pair < int ,int >
20#define MP make_pair

1using namespace std;
2const double eps = 1E-8;
3const int dx4[4]={1,0,0,-1};
4const int dy4[4]={0,-1,1,0};
5const int inf = 0x3f3f3f3f;
6const int N=5E2+7;

1int n;
2int k;
3int ans[N][N];
4int main()
5{
6	#ifndef  ONLINE_JUDGE 
7	freopen("code/in.txt","r",stdin);
8  #endif

 1	cin>>n>>k;
 2	int cnt = 0;
 3	ms(ans,0);
 4	for ( int i = 1 ; i <= n ; i++)
 5	    for ( int j = 1 ; j <= k-1 ; j++)
 6	    {
 7		cnt++;
 8		ans[i][j] = cnt;
 9	    }
10	for ( int i = 1 ; i <= n  ;i++)
11	    for ( int j = k ; j <=n  ;j++)
12	    {
13		cnt++;
14		ans[i][j]=cnt;
15	    }
16	int sum = 0 ;
17//	cout<<"k:"<<k<<endl;
18	for ( int i = 1 ; i <= n ; i++)
19	{
20	    sum +=ans[i][k];

	   // cout<<"sum:"<<sum<<endl;
	}

1	cout<<sum<<endl;
2	for ( int i = 1 ; i <= n ; i++)
3	{
4	    for ( int j = 1 ; j <= n-1 ; j++)
5	    {
6		printf("%d ",ans[i][j]);
7	    }
8	    printf("%d\n",ans[i][n]);
9	}

1  #ifndef ONLINE_JUDGE  
2  fclose(stdin);
3  #endif
4    return 0;
5}