Codeforces Round #342 (Div. 2) C
2 seconds
256 megabytes
standard input
standard output
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.
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.
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.
4 1
28
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16
5 3
85
5 6 17 18 19
9 10 23 24 25
7 8 20 21 22
3 4 14 15 16
1 2 11 12 13 题意:1~n*n 排列在n*n的矩阵 要求每个数字出现一次
每行递增 第k列的和尽可能的大
题解:模拟 以第k列为分界线 左边为 1~n*(k-1)的排列
右边为n*(k-1)+1~n*n 的排列
简单模拟
#include<iostream>
#include<cstdio>
#include<cstring>
#define LL __int64
using namespace std;
int n,k;
int main()
{
scanf("%d%d",&n,&k);
int exm;
int ans=0;
exm=n*(k-1);
int gg=1,ggg=exm+1;
for(int i=exm+1;i<=n*n;i=i+n-k+1)
ans+=i;
printf("%d\n",ans);
for(int i=1;i<=n;i++)
{
for(int j=1;j<k;j++)
{
if(j==1)
printf("%d",gg);
else
printf(" %d",gg);
gg++;
}
for(int j=k;j<=n;j++)
{
if(j==1)
printf("%d",ggg);
else
printf(" %d",ggg);
ggg++;
}
printf("\n");
}
return 0;
}
最新文章
- android-studio-bundle-141.1980579-windows download Site
- 怎样运用好ZBrush中的布尔运算
- forEach 方法 (Array) (JavaScript)
- Linux基础: 系统加载过程和运行级别含义
- JS 实现取整(二)
- iOS开发——新特性OC篇&;IOS9 SDK新特性
- 一则自用iptables例子解释
- PHP反射ReflectionClass、ReflectionMethod 入门教程
- packstack安装以及centos源配置注意事项
- CodeForces 702E Analysis of Pathes in Functional Graph
- Linux安装php的Redis扩展
- Google HTML/CSS 编码规范
- centos登录时一闪而过,显示module is unknown
- 使用JPA中@Query 注解实现update 操作
- Linux下yum安装MysqL数据库
- Phpstorm数组对齐设置
- STS中poem.xml配置文件
- python2程序移植python3的一些注意事项
- python对象属性管理(2):property管理属性
- mysql 创建函数This function has none of DETERMINISTIC, NO SQL, or READS