首页 > 代码库 > codeforces 268C
codeforces 268C
Manao has invented a new mathematical term — a beautiful set of points. He calls a set of points on a plane beautiful if it meets the following conditions:
- The coordinates of each point in the set are integers.
- For any two points from the set, the distance between them is a non-integer.
Consider all points (x,?y) which satisfy the inequations: 0?≤?x?≤?n; 0?≤?y?≤?m; x?+?y?>?0. Choose their subset of maximum size such that it is also a beautiful set of points.
Input
The single line contains two space-separated integers n and m (1?≤?n,?m?≤?100).
Output
In the first line print a single integer — the size k of the found beautiful set. In each of the next k lines print a pair of space-separated integers — the x- and y- coordinates, respectively, of a point from the set.
If there are several optimal solutions, you may print any of them.
Sample test(s)
input
2 2
output
30 11 22 0
input
4 3
output
40 32 13 04 2
题目分析：
要求任意两点之间的距离不是整数。换句话来说，如果两点处于同一行 或同一列 那么肯定不符合要求了。所以每一行每一列只能有一个数。其余的就随你找。我是从左下角开始，沿45°往上，直到边界为止。
自己该换个思路的。总盯着一个东西不放。教训。
代码：
<script src="https://code.csdn.net/snippets/530535.js" type="text/javascript"></script>
codeforces 268C
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。