zoukankan      html  css  js  c++  java
  • sicily 1051. Biker's Trip Odomete

                                    1051. Biker's Trip Odomete

    Time Limit: 1sec    Memory Limit:32MB 
    Description
    Most 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
     Copy sample input to clipboard 
    26 1000 5
    27.25 873234 3000
    26 0 1000
    Sample Output
    Trip #1: 1.29 928.20
    Trip #2: 1179.86 1415.84
    #include <iostream>
    #include <vector>
    #include <stdio.h>
    
    int main(int argc, char* argv[])
    {
        double diameter;
        int revolutions;
        double times;
        int testNum = 0;
        while (std::cin >> diameter >> revolutions >> times && revolutions != 0) {
            testNum++;
    
            double length = 3.1415927 * diameter * revolutions / 5280 / 12;
            double speed = length / (times / 60 / 60);
            printf("Trip #%d: %.2lf %.2lf
    ", testNum, length, speed);
        }
    
        return 0;
    }
  • 相关阅读:
    16年青岛网络赛 1001 I Count Two Three
    最短路算法--模板
    POJ 1511 Invitation Cards (spfa的邻接表)
    POJ 2240 Arbitrage
    POJ 1502 MPI Maelstrom
    POJ 1860 Currency Exchange (最短路)
    最短路径--SPFA 算法
    POJ 3660 Cow Contest
    POJ 3259 Wormholes (Bellman_ford算法)
    POJ 3268 Silver Cow Party (双向dijkstra)
  • 原文地址:https://www.cnblogs.com/xiezhw3/p/3996989.html
Copyright © 2011-2022 走看看