3002048_wa.cpp

北大大牛代码 1240道题的原代码 超级权威

#include <iostream>
#include <string>
#include <math.h>
#include <algorithm>

using namespace std;

int main()
{
	int i, j, n;
	int id;
	double d;
	string t;
	bool fail;
	double h, m, s, min;

	cin >> n >> d;
	while(cin >> id)
	{
		fail = false;
		min = 0;
		for(j = 0; j < n; j++)
		{
			cin >> t;
			if(fail)
			{
				continue;
			}
			int pos = t.find('-',0);
			if(pos >= 0 && pos < t.length())
			{
				fail = true;
				continue; 
			}
			h = 0;m = 0;s = 0;i = 0;
			for(; t.at(i)!=':'; i++)
			{
				h *= 10;
				h += (t.at(i)-'0');
			}
			i++;
			for(; t.at(i)!=':'; i++)
			{
				m *= 10;
				m += (t.at(i)-'0');
			}
			i++;
			for(; i < t.length(); i++)
			{
				s *= 10;
				s += (t.at(i)-'0');
			}
			min += h*60.0 + m + s/60.0;
		}
		if(fail)
		{
			printf("%3d: -\n",id);
		}
		else
		{
			min /= d;
			int mm = (int)((floor)(min));
			double ss = (min - (floor)(min))*60;
			int r;
			r = (int)((floor)(ss*10));
			if(r%10 > 4)
			{
				r = 0;
				mm ++;
			}
			r /= 10;
			printf("%3d: %d:%02d min/km\n",id,mm,r);
		}	
	}
	return 0;
}