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

    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.

    小学计算题……

    #include <cstdio>
        
    int main(void) {
    #ifdef JDEBUG
        freopen("1051.in", "r", stdin);
        freopen("1051.out", "w", stdout);
    #endif
        const double pi = 3.1415927;
        const int ipm = 12 * 5280;  // inches per mile
        const int sph = 60 * 60;  // seconds per hour
    
        double diameter;  // in inches
        int revolution;
        double time;  // seconds
        int count = 1;
        while (scanf("%lf %d %lf", &diameter, &revolution, &time) && revolution != 0) {
            double miles = diameter * pi * revolution / ipm;
            double hours = time / sph;
            double mph = miles / hours;
            printf("Trip #%d: %.2lf %.2lf
    ", count++, miles, mph);
        }
        
        return 0;
    }
  • 相关阅读:
    idea常用快捷键及操作
    Ubuntu 装nexus
    ubuntu安装gitlab
    ubuntu安装jdk,maven,tomcat
    ubuntu安装gitlab-ci-runner、注册
    ubuntu开启远程shell,开启上传下载
    Ubuntu安装软件提示boot空间不足
    POJ3461 KMP简单变形输出模式串在主串出现的次数
    涨姿势stl map['a']['a']=b;
    对链表的操作(数据结构线性表算法设计练习)
  • 原文地址:https://www.cnblogs.com/joyeecheung/p/3998881.html
Copyright © 2011-2022 走看看