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=; 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.\n",i,(int)((r)*pi/+));
}
printf("END OF OUTPUT.\n");
return ;
}

最新文章

  1. dsaf
  2. X86上搭建交叉工具链,来给龙芯笔记本编译本地工具链(未完待续)
  3. OpenGL Driver Architecture[转]
  4. 如何使用Sitemap和menu创建网站导航
  5. JS监听组合按键
  6. sharepoint 2013 文档库 资源管理器打开报错 在文件资源管理器中打开此位置时遇到问题,将此网站添加到受信任站点列表,然后重试。
  7. 管理支撑办公系统技术架构选型对照讨论(J2EE与SOA对照)
  8. ural1028 Stars
  9. python重试装饰器的简单实现
  10. voip技术研究
  11. netty学习资源收集
  12. SQLite3问题
  13. netty中的传输
  14. Jquery Mobile事件
  15. TIJ -- 吐司BlockingQueue
  16. easyUI拖动课程进课程表
  17. #JS 前端javascript规范文档
  18. iOS开发之按钮的基本使用
  19. CF-1055E:Segments on the Line (二分&amp;背包&amp;DP优化)(nice problem)
  20. Linux:CentOS7卸载mysql

热门文章

  1. json转换为字典
  2. windows server 服务器 环境配置
  3. MySQL如何复制一个表
  4. 【android】【转发】Android中PX、DP、SP的区别
  5. Python学习笔记:configparser(INI格式配置文件解析)
  6. 使用TensorFlow的卷积神经网络识别手写数字(1)-预处理篇
  7. usb driver编写 (转)
  8. HDU:4185-棋盘游戏
  9. SpringBoot接收前端参数的三种方法
  10. day07 类的进阶,socket编程初识