zoukankan      html  css  js  c++  java
  • 1005—I Think I Need a Houseboat

    I Think I Need a Houseboat
    Time Limit: 1000MS Memory Limit: 10000K
    Total Submissions: 105572 Accepted: 45982

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

    1005—I <wbr>Think <wbr>I <wbr>Need <wbr>a <wbr>Houseboat

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

    Sample Input

    
    
    1.0 1.0 
    
    25.0 0.0
    

    Sample Output

    Property 1: This property will begin eroding in year 1.
    
    Property 2: This property will begin eroding in year 20.
    
    END OF OUTPUT.
    
    
    
    
    
    #include 
    
    #include 
    
    double PI=3.1415926;
    
    int main()
    
    {
    
       int k,count=1;
    
       double s,x,y;
    
       scanf("%d",&k);
    
       while(k--)
    
       {
    
         scanf("%lf%lf",&x,&y);
    
         s=(PI/2)*(x*x+y*y);
    
       printf("Property %d: This property will begin eroding in year %d.
    ",count++,(int)                (s/(double)50+1));//注意数据的类型
    
       }
    
       printf("END OF OUTPUT.
    ");
    
       return 0;
    
    }
    

  • 相关阅读:
    poj 3264(RMQ或者线段树)
    LCA上的RMQ模板算法
    LCA离线算法Tarjan的模板
    poj 1330(初探LCA)
    hdu 3367(与最大生成树无关。无关。无关。重要的事情说三遍+kruskal变形)
    hdu 4496(并查集逆向添边)
    hdu 1829(继续扩展并查集)
    poj 1182 (扩展并查集)
    hdu 3038(扩展并查集)
    hdu 3371(kruskal)
  • 原文地址:https://www.cnblogs.com/kuroko-ghh/p/9363390.html
Copyright © 2011-2022 走看看