Codeforces 507B Amr and Pins【思维】
来源:互联网 发布:淘宝给差评遭报复杀人 编辑:程序博客网 时间:2024/04/29 03:09
Amr loves Geometry. One day he came up with a very interesting problem.
Amr has a circle of radius r and center in point(x, y). He wants the circle center to be in new position(x', y').
In one step Amr can put a pin to the border of the circle in a certain point, then rotate the circle around that pin by any angle and finally remove the pin.
Help Amr to achieve his goal in minimum number of steps.
Input consists of 5 space-separated integers r,x, y,x' y' (1 ≤ r ≤ 105, - 105 ≤ x, y, x', y' ≤ 105), circle radius, coordinates of original center of the circle and coordinates of destination center of the circle respectively.
Output a single integer — minimum number of steps required to move the center of the circle to the destination point.
2 0 0 0 4
1
1 1 1 4 4
3
4 5 6 5 6
0
In the first sample test the optimal way is to put a pin at point (0, 2) and rotate the circle by 180 degrees counter-clockwise (or clockwise, no matter).
给你一个圆,其半径为R,我们想将圆的圆心从X,Y,移动到X',Y'.每次移动可以选择圆上一点,并且将圆旋转任意角度,问最少用多少步就能将圆心移动到X',Y';
思路:
贪心的去走,每次我们都走2r长度的路径,如果不满2r长度的,也算走一步。
Ac代码:
#include<stdio.h>#include<string.h>#include<math.h>#include<algorithm>#include<iostream>using namespace std;#define ll __int64double r,x,y,x2,y2;int main(){ while(~scanf("%lf%lf%lf%lf%lf",&r,&x,&y,&x2,&y2)) { double dis=sqrt((x2-x)*(x2-x)+(y2-y)*(y2-y)); double ans=dis/(2*r); ll ans1=(ll)ans; if(ans1!=ans) { ans1++; } printf("%I64d\n",ans1); }}
- Codeforces 507B Amr and Pins【思维】
- codeforces-#287-- 507B Amr and Pins
- Codeforces-507B-Amr and Pins
- codeforces--507A--A. Amr and Music--507B--B. Amr and Pins
- B. Amr and Pins
- B. Amr and Pins
- B. Amr and Pins
- B. Amr and Pins( Codeforces Round #287 (Div. 2))
- B. Amr and Pins (Codeforces Round #287 (div2))
- coderforce 2057B Amr and Pins
- Amr and Pins
- Amr and Pins
- CodeForces_507B_Amr and Pins(思维题)
- codeforce 558B Amr and The Large Array 思维题
- codeforces #312 B B. Amr and The Large Array(统计)
- Amr and Pins——圆的旋转
- Codeforces 558B Amr and The Large Array(hash)
- Codeforces 558B Amr and The Large Array
- 快乐很简单
- 查看Android 系统发送的广播
- OSX小白安装MySQL中出现的问题
- javascript学习之日期 字符串(19)—— 字符串 常用方法(下)
- How JQuery Works
- Codeforces 507B Amr and Pins【思维】
- GenericServlet源码
- iOS--手动计算frame的精度丢失问题
- 为什么我们使用Nginx而不是Apache?
- iOS swift 支持中文斜体的方法 自己整理
- iOS 工作之余小总结 -- (五)(1) 最简单的Block教程 及Block与全局(局部)变量
- httpClient的POST方式使用的工具类
- 5 Steps to Build a Drupal 8 Multi-lingual Site
- DES 加密解密详解 CCCrypt函数