C 解法, 执行用时: 1ms, 内存消耗: 376KB, 提交时间: 2020-08-13

#include<stdio.h>
#include<stdlib.h>
#pragma warning (disable:4996)

int main(void)
{
	int T;
	scanf("%d", &T);
	int max = T;
	int **time;
	time = (int**)malloc(max * sizeof(int*));
	for (int i = 0; i < max; i++)
	{
		time[i] = (int*)malloc(3 * sizeof(int));
	}
	int HH = 0, MM = 0, SS = 0;
	while (T--)
	{
		scanf("%d:%d:%d", &HH, &MM, &SS);
		if (HH > 23)
			HH = HH % 10;
		if (MM > 59)
			MM = MM % 10;
		if (SS > 59)
			SS = SS % 10;
		time[max - T - 1][0] = HH;
		time[max - T - 1][1] = MM;
		time[max - T - 1][2] = SS;
		printf("%02d:%02d:%02d\n", time[max - T - 1][0], time[max - T - 1][1], time[max - T - 1][2]);
	}
	for (int i = 0; i < max; i++)
	{
		free(time[i]);
	}
	free(time);

	return 0;
}

C 解法, 执行用时: 1ms, 内存消耗: 376KB, 提交时间: 2018-08-09

#include <stdio.h>
int main()
{
	char time[9];
	int h,m,s;
	int T;
	scanf("%d",&T);
	getchar();
	while (T--)
	{
		scanf("%s",time);
		h = (time[0]-'0')*10 + (time[1]-'0');
		m = (time[3]-'0')*10 + (time[4]-'0');
		s = (time[6]-'0')*10 + (time[7]-'0');
		if (h>=24)time[0]='0';
		if (m>59)time[3]='0';
		if (s>59)time[6]='0';
		printf("%c%c:%c%c:%c%c\n",time[0],time[1],time[3],time[4],time[6],time[7]);
	}
	return 0;
}