#include <iostream>
#include <string>
using namespace std; int main()
{ int n;
int h, m, s;
int AH, AM, AS, BH, BM, BS;
int flag = ;
cin >> n;
while (n--)
{
cin >> AH >> AM >> AS;
cin >> BH >> BM >> BS; flag = ;
s = AS + BS;
if (s >= )
{
s %= ;
flag = ;
}
m = AM + BM + flag;
if (m >= )
{
m %= ;
flag = ;
}
h = AH + BH + flag;
//if (h >= 24)
//{
// h %= 24;
//flag = 1;
//}
cout << h << " " << m << " " << s << endl;
} }
相关文章
- 08-29HDOJ1020 Encoding
- 08-29[优先队列]HDOJ5360 Hiking
- 08-29hdoj 1715 大菲波数
- 08-29hdu 3342 Legal or Not(拓扑排序) HDOJ Monthly Contest – 2010.03.06
- 08-29hdoj 2066 一个人的旅行
- 08-29HDOJ 2062 Subset sequence
- 08-29hdoj2896(AC自动机简单题)
- 08-29【HDOJ6595】Everything Is Generated In Equal Probability(期望DP)
- 08-29**HDoj 2045 不容易系列之(3)—— LELE的RPG难题
- 08-29【HDOJ6579】Operation(线性基)