zoukankan      html  css  js  c++  java
  • hdu 1065(推公式)

    I Think I Need a Houseboat

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 12114    Accepted Submission(s): 3407


    Problem Description


    Fred Mapper is considering purchasing some land in Louisiana to build his house on. In the process of investigating the land, he learned that the state of Louisiana is actually shrinking by 50 square miles each year, due to erosion caused by the Mississippi River. Since Fred is hoping to live in this house the rest of his life, he needs to know if his land is going to be lost to erosion.

    After doing more research, Fred has learned that the land that is being lost forms a semicircle. This semicircle is part of a circle centered at (0,0), with the line that bisects the circle being the X axis. Locations below the X axis are in the water. The semicircle has an area of 0 at the beginning of year 1. (Semicircle illustrated in the Figure.)

     
    Input
    The first line of input will be a positive integer indicating how many data sets will be included (N).

    Each of the next N lines will contain the X and Y Cartesian coordinates of the land Fred is considering. These will be floating point numbers measured in miles. The Y coordinate will be non-negative. (0,0) will not be given.
     
    Output

    For each data set, a single line of output should appear. This line should take the form of:

    “Property N: This property will begin eroding in year Z.”

    Where N is the data set (counting from 1), and Z is the first year (start from 1) this property will be within the semicircle AT THE END OF YEAR Z. Z must be an integer.

    After the last data set, this should print out “END OF OUTPUT.”

    Notes:

    1. No property will appear exactly on the semicircle boundary: it will either be inside or outside.

    2. This problem will be judged automatically. Your answer must match exactly, including the capitalization, punctuation, and white-space. This includes the periods at the ends of the lines.

    3. All locations are given in miles.

    pi*R[n]^2-pi*R[n-1]^2 =100 得到 R[n]^2 = 100*n/pi

    直接得结果,破题有毒,pi只能取3.1415926

    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    #include<math.h>
    using namespace std;
    typedef long long LL;
    const double pi = 3.1415926;
    
    int main()
    {
        int t;
        scanf("%d",&t);
        for(int i=1; i<=t; i++)
        {
            double x,y;
            scanf("%lf%lf",&x,&y);
            double r = x*x+y*y;  ///半径的平方
            printf("Property %d: This property will begin eroding in year %d.
    ",i,(int)((r)*pi/100+1));
        }
        printf("END OF OUTPUT.
    ");
        return 0;
    }
  • 相关阅读:
    tomcat配置虚拟主机
    android widget 开发实例 : 桌面便签程序的实现具体解释和源代码 (上)
    Delphi 2007体验!
    ACE定时器
    Unity--关于优化方面的那些事儿(一)
    LTP介绍
    Java正則表達式入门
    Spring整合Hibernate的步骤
    ThreadPool.QueueUserWorkItem的性能问题
    用Bootstrap 写了个站点
  • 原文地址:https://www.cnblogs.com/liyinggang/p/5571296.html
Copyright © 2011-2022 走看看