Introduction
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 <= 100) is the radius of your planet in integer milesY : (0 <= Y <= 100) is the amount of gasoline in your planet-rover in integer gallonsZ : (0 <= Z <= 360) is an angle separating you from the crash site in integer degrees
End line - A single line, "END". Following the final data set will be a single line, "ENDOFINPUT".
Take note of the following: The circumference of a circle in terms of its radius, r, is known to be 2πr Assume that π = 3.14159
OutputFor each data set, there will be exactly one line of output. If you have enough fuel to get to the crash site and back, the line will read, "YES X" where X is the amount of fuel you will have left expressed as an integer number of gallons (truncate any fractional gallons). If you do not have sufficient fuel, the line will read, "NO Y" where Y is the distance you can travel expressed as an integer number of miles.
Sample Input
START1 100 0ENDSTART10 0 1ENDSTART100 50 90ENDSTART100 50 270ENDENDOFINPUT
Sample Output
YES 100NO 0NO 250NO 250
这道题，做了好久，，不是因为难，是因为烦！除了烦还是烦！输出格式，输入格式要注意就行了！汗一个，最后ac了，还是听爽的呵呵！！！
#include
<
stdio.h
>
#include
<
stdlib.h
>
#include
<
string
.h
>
#define
pi 3.14159
int
main()
...
{ char ch[11]; float x,z; float y; gets(ch); while(strcmp(ch,"START")== 0) ...{ scanf("%f%f%f", &x,&y,&z); if(z > 180.0) z = 360.0 - z; float d = 2.0 * pi * x; float s = y * 5; d = d * z / 180.0; if(d > s ) printf("NO %d ", (int)s); else printf("YES %d ", (int)((s - d)/5.0) ); getchar(); gets(ch); gets(ch); } system("pause"); return 0; }
