[微软]题目1 : Farthest Point

最新推荐文章于 2024-10-20 20:27:13 发布

周大侠

最新推荐文章于 2024-10-20 20:27:13 发布

阅读量1k

点赞数

CC 4.0 BY-SA版权

分类专栏： 2016笔试 C++

本文链接：https://blog.youkuaiyun.com/whzyb1991/article/details/48811663

C++ 同时被 2 个专栏收录

57 篇文章

订阅专栏

2016笔试

5 篇文章

订阅专栏

给定二维平面上的一个圆，本题要求输出该圆上距离圆心最远的整数点坐标。若存在多个最远点，则优先选择横坐标最大的点；若横坐标相同，则选择纵坐标最大的点。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目1 : Farthest Point
时间限制:5000ms
单点时限:1000ms
内存限制:256MB
描述
Given a circle on a two-dimentional plane.

Output the integral point in or on the boundary of the circle which has the largest distance from the center.

输入
One line with three floats which are all accurate to three decimal places, indicating the coordinates of the center x, y and the radius r.

For 80% of the data: |x|,|y|<=1000, 1<=r<=1000

For 100% of the data: |x|,|y|<=100000, 1<=r<=100000

输出
One line with two integers separated by one space, indicating the answer.

If there are multiple answers, print the one with the largest x-coordinate.

If there are still multiple answers, print the one with the largest y-coordinate.



样例输入
1.000 1.000 5.000
样例输出
6 1
EmacsNormalVim