hnu acm Problem 10016 Polar Explorer

最新推荐文章于 2018-11-29 19:36:36 发布

manio

最新推荐文章于 2018-11-29 19:36:36 发布

阅读量1.9k

点赞数

分类专栏： Algorithm 文章标签： integer crash input iostream components distance

本文链接：https://blog.csdn.net/manio/article/details/1360283

版权

该博客主要关注 ACM 题目10016，强调在处理double类型输入输出时的注意事项。在输入时，正确格式为scanf("%lf",&a)，而在输出整型结果时，应使用printf("%d", int(....))避免浮点数显示。" 109528658,9225194,理解朴素贝叶斯算法：原理与应用,"['机器学习', '算法', '朴素贝叶斯']

摘要由CSDN通过智能技术生成

Polar Explorer

Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB

Total submit users: 118, Accepted users: 110

Problem 10016 : No special judgement

Problem description

You are a intrepid 2-dimensional explorer located at the northern polar reaches of a distant 2-dimensional planet. Unfortunately, you have been assigned to explore the most boring planet in the known universe (due primarily to your lack of social skills and aggressive body odor). Having a perfectly circular surface, your planet holds no surprises for a would-be explorer.

However, you have recently received a distress call from an alien ship which has crash-landed somewhere on the surface of your planet. Unfortunately, you designed your own equipment, and the only information it will give you is an angle (measured from the center of the planet) separating you from the crash site.

Using this information along with how much gasoline is available for your planet-rover (which gets a measley 5 miles per gallon), you have to determine if you can possibly get to the crash site and back without running out of fuel.

Input

Input to this problem will consist of a (non-empty) series of up to 100 data sets. Each data set will be formatted according to the following description, and there will be no blank lines separating data sets. A single data set has 3 components:
Start line - A single line, "START".
Input line - A single line, "X Y Z", where:
X : (1 <= X <=