这道题是小学级别的题目,不知道为什么 https://web.stanford.edu/class/cs97si/assn1.html 这里把它的难度标为5(和POJ1001这道有点麻烦的题难度相同),可能因为老外数学太差?
题目
http://poj.org/problem?id=1922
答案
using namespace std;
int main()
{
int n, v, t, s;
double kph2mpsFactor = 5.0 / 18.0;
int distance = 4500;
while (cin >> n && n != 0) {
int minArriveTime = INT_MAX;
for (int i = 0; i < n; i++) {
cin >> v >> t;
s = ceil(distance / (v * kph2mpsFactor) + t);
minArriveTime = minArriveTime > s && t >= 0 ? s : minArriveTime;
}
cout << minArriveTime << endl;
}
return 0;
}