杭电OJ——1038 Biker's Trip Odometer
2013-07-07 15:39
399 查看
Biker's Trip Odometer
Problem DescriptionMost bicycle speedometers work by using a Hall Effect sensor fastened to the front fork of the bicycle. A magnet is attached to one of the spokes on the front wheel so that it will line up with the Hall Effect switch once per revolution of the wheel. The speedometer
monitors the sensor to count wheel revolutions. If the diameter of the wheel is known, the distance traveled can be easily be calculated if you know how many revolutions the wheel has made. In addition, if the time it takes to complete the revolutions is known,
the average speed can also be calculated.
For this problem, you will write a program to determine the total distance traveled (in miles) and the average speed (in Miles Per Hour) given the wheel diameter, the number of revolutions and the total time of the trip. You can assume that the front wheel
never leaves the ground, and there is no slipping or skidding.
Input
Input consists of multiple datasets, one per line, of the form:
diameter revolutions time
The diameter is expressed in inches as a floating point value. The revolutions is an integer value. The time is expressed in seconds as a floating point value. Input ends when the value of revolutions is 0 (zero).
Output
For each data set, print:
Trip #N: distance MPH
Of course N should be replaced by the data set number, distance by the total distance in miles (accurate to 2 decimal places) and MPH by the speed in miles per hour (accurate to 2 decimal places). Your program should not generate any output for the ending case
when revolutions is 0.
Constants
For p use the value: 3.1415927.
There are 5280 feet in a mile.
There are 12 inches in a foot.
There are 60 minutes in an hour.
There are 60 seconds in a minute.
There are 201.168 meters in a furlong.
Sample Input
26 1000 5 27.25 873234 3000 26 0 1000
Sample Output
Trip #1: 1.29 928.20 Trip #2: 1179.86 1415.84
Source
Greater New York 2003
很简单的一道题目,不多说!
代码:
#include <iostream> using namespace std; const float pi = 3.1415927; int main() { float diameter, time; int revolutions; int counts = 1; while ((cin >> diameter >> revolutions >> time) && (revolutions != 0)) { float distances, speed; distances = pi * diameter * revolutions / 63360; speed = distances / (time / 3600); printf ("Trip #%d: %.2f %.2f\n", counts, distances, speed); ++counts; } system ("pause"); return 0; }
相关文章推荐
- 杭电ACM HDU 1038 Biker's Trip Odometer
- 杭电 HDU 1038 Biker's Trip Odometer
- hdu 1038(ACM steps 1.2.1)Biker's Trip Odometer
- HDU(简单题目) 1038 Biker's Trip Odometer 1039 Easier Done Than Said?
- HDU 1038 Biker's Trip Odometer
- HDU1038 Biker's Trip Odometer(java)
- hdu 1038 Biker's Trip Odometer(水题)
- 杭电acm Biker's Trip Odometer
- HDU 1038 Biker's Trip Odometer
- HDU-1038-Biker's Trip Odometer(C++ && 提高英语能力!)
- 杭电OJ(HDU)-ACM Steps-Chapter Two-《Biker's Trip Odometer》《Climbing Worm》《hide handkerchief》《Nasty Hac》
- hdu 1038 Biker's Trip Odometer(水题)
- hdu 1038 Biker's Trip Odometer(简单计算题)
- #1665:Biker's Trip Odometer--scanf数据类型读取
- ZOJ 1813 Biker's Trip Odometer
- 1813_Biker's Trip Odometer
- 1038 Biker's Trip Odometer
- hdu acm steps Biker's Trip Odometer
- Biker's Trip Odometer
- zoj1813--------------Biker's Trip Odometer