首页 > 代码库 > HDU-2033
HDU-2033
/********************************************************************@file Main_practise.cpp@date 2014-9-11@author Tiger@brief 人见人爱A+B********************************************************************/#include <cstdio>#include <cstring>#define MAX 60struct sTime{ sTime(void) : m_nHou(0), m_nMin(0), m_nSec(0) { } int m_nHou; int m_nMin; int m_nSec;};int main(int argc, const char* argv[]){ int nTestCases = 0; scanf("%d", &nTestCases); while (nTestCases--) { sTime timeA, timeB; scanf("%d%d%d%d%d%d", &timeA.m_nHou, &timeA.m_nMin, &timeA.m_nSec, &timeB.m_nHou, &timeB.m_nMin, &timeB.m_nSec); timeA.m_nSec += timeB.m_nSec; if (timeA.m_nSec >= MAX) { timeA.m_nMin += timeA.m_nSec/MAX; timeA.m_nSec = timeA.m_nSec%MAX; } timeA.m_nMin += timeB.m_nMin; if (timeA.m_nMin >= MAX) { timeA.m_nHou += timeA.m_nMin/MAX; timeA.m_nMin = timeA.m_nMin%MAX; } timeA.m_nHou += timeB.m_nHou; printf("%d %d %d\n", timeA.m_nHou, timeA.m_nMin, timeA.m_nSec); } return 0;}
HDU-2033
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。