zoukankan      html  css  js  c++  java
  • UVA 11355 Cool Points(几何)

    Cool Points

    We have a circle of radius R and several line segments situated within the circumference of this circle. Let’s define a cool point to be a point on the circumference of this circle so that the line segment that is formed by this point and the centre of the circle makes no intersection with any of the given line segments.

    For this problem, you have to find out the percentage of cool points from all possible points on the circumference of the given circle.

    Input

    The input file starts with an integer T(T<1000) that indicates the number of test cases. Each case starts with 2 integers N(0 <= N < 100) and R(0 < R < 1001). N represents the number of line segments and R represents the radius of the circle. Each of the next N lines contains 4 integers in the order x1, y1,x2 and y2. (x1, y1)(x2, y2) represents a line segment.

    You can assume that all the line segments will be inside the circle and no line segment passes through the origin. Also consider the center of the circle to be on the origin.

    Output

    For each input, output the case number followed by the percentage, rounded to 2 decimal places, of cool points. Look at the output for exact format.

    Sample Input

    Output for Sample Input

    2

    1 10

    2 0 0 2

    0 5

    Case 1: 75.00%

    Case 2: 100.00%

    view code
  • 相关阅读:
    每日英语:AntiJapan Protests Flare in China
    opencv CvMat矩阵学习
    warning C4018有符号无符号不匹配
    每日英语:Relationship Repair: 10 Tips for Thinking Like a Therapist
    结构体数组定义和引用
    每日英语:China's Conflicted Consumers
    一个托盘程序, 简化notifyicon的使用.
    nunit notes from TDD in .net
    一款能拖拉的winform树形控件
    vss 2005 internet visit
  • 原文地址:https://www.cnblogs.com/zyx1314/p/3902510.html
Copyright © 2011-2022 走看看