sicily 1051. Biker's Trip Odomete
2011-07-14 19:32
288 查看
#include <iostream> #include<stdio.h> #include<cmath> using namespace std; #define pi acos(-1.0) int main() { int n=1; double d,r,t; while(cin>>d>>r>>t,r) { printf("Trip #%d: %.2f %.2f\n",n++, r*d*pi/63360 , r*d*pi*3600/(63360*t) ); } return 0; }
相关文章推荐
- sicily 1051. Biker's Trip Odomete
- sicily 1051. Biker's Trip Odomete
- Sicily 1051. Biker's Trip Odomete
- sicily 1051. Biker's Trip Odomete
- sicily--1051. Biker's Trip Odomete
- [sicily online]1051. Biker's Trip Odomete
- Sicily 1051. Biker's Trip Odomete
- sicily 1051. Biker's Trip Odomete
- 1051. Biker's Trip Odomete
- Biker's Trip Odomete
- 1051. Biker's Trip Odomete
- Sicily.1051. Biker's Trip Odomete
- 1051. Biker's Trip Odomete
- 1051. Biker's Trip Odomete题解
- Sicily 1051. Biker's Trip Odomete Description
- SOJ.Biker's Trip Odomete
- Sicily 1797. Do solve it directly
- sicily 1888循环队列的最大子段和
- Sicily 1020 Big Integer
- Sicily 1073. Pearls[动规]