zoukankan      html  css  js  c++  java
  • hdu_1038_Biker's Trip Odometer_201311021643

    Biker's Trip Odometer

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3061    Accepted Submission(s): 2103

    Problem 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
    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
     
    Recommend
     
     1 #include <stdio.h>
     2 #define pi 3.1415927
     3 
     4 int main()
     5 {
     6     double a,c;
     7     int b,k=1;
     8     while(scanf("%lf %d %lf",&a,&b,&c),b)
     9     {
    10         printf("Trip #%d: ",k++);
    11         printf("%.2lf %.2lf
    ",2*pi*a*b/2/12/5280,2*pi*a*b*3600/2/12/5280/c);
    12     }
    13     return 0;
    14 }

    简单题,轻松水过

  • 相关阅读:
    城市生态规划关键技术方法之三:城市生态系统服务功能理论与方法
    AE中用矢量数据剪裁栅格
    城市生态规划的基本原理与程序
    城市生态规划关键技术方法之一:生态系统健康理论与方法
    城市生态规划的基本概念、内容与方法
    终于找到使用Sql Server Management Studio导致蓝屏的罪魁祸首了
    保证相同类型的MDI子窗体只会被打开一次的方法
    甩掉数据字典,让Sql Server数据库也来一个自描述
    新鲜试用IE8 beta2
    让我目瞪口呆的program.exe
  • 原文地址:https://www.cnblogs.com/xl1027515989/p/3403931.html
Copyright © 2011-2022 走看看