POJ 2565 Average is not Fast Enough!

注意下格式就好。。

#include "stack"
#include "cstdio"
#include "iostream"
#include "cmath"
#include "set"
#include "sstream"
#include "cctype"
#include "string"
#include "cstring"
#include "algorithm"
#include "queue"
#include "map"
using namespace std;
#define LL long long
#define inf 0x7ffffff
#define pa pair<int,int>
#define pi 3.1415926535897932384626433832795028841971

const int M = 15;

int main()
{
	char s[M];
	int i, n, H, MM, SS, T, ans;
	double dist, tot, ave;
	bool flag;
	scanf("%d%lf", &n, &dist);
	while (~scanf("%d", &T))
	{
		tot = 0.0;
		flag = true;
		for (i = 0; i < n; i++)
		{
			scanf("%s", s);
			if (!strcmp(s, "-:--:--"))
			{
				flag = false;
			}
			else
			{
				sscanf(s, "%d:%d:%d", &H, &MM, &SS);
				tot += H*3600.0 + MM*60.0 + SS*1.0;
			}
		}
		if (flag == false)
		{
			printf("%3d: -\n", T);
		}
		else
		{
			ave = tot / dist;
			ans = floor(ave + 0.5);
			printf("%3d: %d:%02d min/km\n", T, ans / 60, ans % 60);
		}
	}
	return 0;
}