zoukankan      html  css  js  c++  java
  • ZOJ1608 Two Circles and a Rectangle

    Time Limit: 2 Seconds      Memory Limit: 65536 KB

    Give you two circles and a rectangle, your task is to judge wheather the two circles can be put into the rectangle with no part of circles outside the retangle.


    Input

    There are multiple test cases. In every test cast, there are four float-point numbers:

    a, b, r1, r2

    where, a and b are two sides of the rectangle, r1 and r2 are radii of the two circls.


    Output

    Print a "Yes", if the circles can be put into the rectangle. Otherwise, print a "No".

    You can safely assume x < y, where x and y are float-point numbers, if x < y + 0.01.


    Sample Input

    5 4 1 1
    5 4 1.5 2


    Sample Output

    Yes
    No

    做点水题,舒缓心情,享受人生

    简单计算几何

    大概没什么好解释的,放进去两个圆以后,根据它们的“横纵方向最大间隔距离”和“半径之和”来判断能否装下。

     1 /*by SilverN*/
     2 #include<algorithm>
     3 #include<iostream>
     4 #include<cstring>
     5 #include<cstdio>
     6 #include<cmath>
     7 using namespace std;
     8 const int mxn=100010;
     9 double a,b,r1,r2;
    10 int main(){
    11     while(scanf("%lf%lf%lf%lf",&a,&b,&r1,&r2)!=EOF){
    12         if(a<b)swap(a,b);
    13         if(r1<r2)swap(r1,r2);
    14         if(b<=r1*2){printf("No
    ");continue;}
    15         double x1=a-r1-r2;
    16         double y1=b-r1-r2;
    17         double r=r1+r2;
    18         if(x1*x1+y1*y1-r*r>=0.01)
    19             printf("Yes
    ");
    20         else printf("No
    ");
    21     }
    22     return 0;
    23 }
  • 相关阅读:
    gitbook
    Goland IDE使用
    go-zero RPC 框架安装 (goctl安装, protoc安装, etcd安装)
    go 打包部署
    GO redis
    go 常见异常
    go 异常处理
    go常用数据处理 (json, map, 结构体)
    Kafka日志消息
    【leetcode_easy_math】1317. Convert Integer to the Sum of Two No-Zero Integers
  • 原文地址:https://www.cnblogs.com/SilverNebula/p/6480841.html
Copyright © 2011-2022 走看看