zoukankan      html  css  js  c++  java
  • CodeForces

    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

    Input consists of 5 space-separated integers rxyxy' (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

    Output a single integer — minimum number of steps required to move the center of the circle to the destination point.

    Examples

    Input

    2 0 0 0 4
    

    Output

    1
    

    Input

    1 1 1 4 4
    

    Output

    3
    

    Input

    4 5 6 5 6
    

    Output

    0
    

    Note

    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).

    题解:每次我们可以看出圆心其实是移动直径的距离,然后如果两个位置之间的距离/直径的距离,然后向上取整就可以

    注意x1,y1,x,y都是double型,不然会WA

    代码:
     

    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    #include<iostream>
    #include<cmath>
    
    using namespace std;
    
    
    int main()
    {
    	
    	double r,x,y,x1,y1;
    	cin>>r>>x>>y>>x1>>y1;
        long double s1=(x-x1)*(x-x1)+(y-y1)*(y-y1);
        long long int m=sqrt(s1)*1.0/(2*r);
    	double k=sqrt(s1)*1.0/(2*r);
    	//cout<<m<<" "<<k<<endl; 
    	if(k>m)
    	{
    		cout<<m+1<<endl;
    	}
    	else
    	{
    		cout<<m<<endl;
    	}
    	
    	return 0;
    }
  • 相关阅读:
    Python进阶文档
    Docker 启动 RabbitMQ
    Lending Club 贷款业务信用评分卡建模
    Lending Club 公司2007-2018贷款业务好坏帐分析
    Lending Club 公司2007-2018贷款业务初步分析
    电子商务网站用户行为分析及服务推荐
    机器学习实战总结
    机器学习实战 11- SVD
    机器学习实战 10-PCA
    机器学习实战 9-FP-growth算法
  • 原文地址:https://www.cnblogs.com/Staceyacm/p/10781878.html
Copyright © 2011-2022 走看看