Codeforces #164 C. Beautiful Sets of Points ( 思维
来源:互联网 发布:百分百营销软件好用吗 编辑:程序博客网 时间:2024/05/22 07:02
C. Beautiful Sets of Points
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.
The single line contains two space-separated integers n and m (1 ≤ n, m ≤ 100).
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.
2 2
3
0 1
1 2
2 0
4 3
4
0 3
2 1
3 0
4 2
Consider the first sample. The distance between points (0, 1) and (1, 2) equals , between (0, 1) and (2, 0) — , between (1, 2) and (2, 0) — . Thus, these points form a beautiful set. You cannot form a beautiful set with more than three points out of the given points. Note that this is not the only solution.
距离不是整数既两个点的X/Y不能相同么
所以点数既min(m,n)+1
按照正方形对角线所以计算下从左上到右下的对角线就可以了
#include <stdio.h>#include <algorithm>using namespace std; int main(){ int n, m; while(~scanf("%d%d",&n,&m)) { int ans = min(n,m); printf("%d\n",ans+1); for(int i = 0;i <= ans; i++) { printf("%d %d\n",i,ans-i); } }return 0;}
- Codeforces #164 C. Beautiful Sets of Points ( 思维
- Codeforces 268C Beautiful Sets of Points【思维】
- Codeforces Round #164 (Div. 2) C. Beautiful Sets of Points【思维题】
- C. Beautiful Sets of Points
- CF268C. Beautiful Sets of Points
- Codeforces #24 C. Sequence of points
- CodeForces 24C Sequence of points (几何)
- Codeforces 466C Number of Ways【思维】
- Codeforces--486D-----Valid Sets思维
- Codeforces 651B Beautiful Paintings【思维】
- 思维 CodeForces - 651B Beautiful Paintings
- Codeforces Round #432 (Div. 2) C 850A Five Dimensional Points(思维)
- codeforces 593 C. Beautiful Function
- C. Vasya and Beautiful Arrays----思维题
- Codeforces Round #230 (Div. 2) C. Blocked Points D. Tower of Hanoi
- Codeforces Round #230 (Div. 2) C. Blocked Points D. Tower of Hanoi
- Codeforces 469D Two Sets【思维+并查集】
- CodeForces 55D. Beautiful numbers (思维+数位DP)
- Spring Boot +Spring AOP 可插拔式日志思路
- 选择价值
- Cannot find module 'laravel-elixir'/工具
- ACM程序设计书中题目L
- L1-019. 谁先倒
- Codeforces #164 C. Beautiful Sets of Points ( 思维
- Eclipse在新建项目时候new中只有poject,example,others解决办法
- 兴趣与工作
- spring 学习之四(spring的注入方式(xml和annotation))
- Jquery节点操作
- 嘟哝之JDK -- ArrayBlockingQueue
- html文档
- javascript基础
- JAVA中的网络编程详解