HDU2033两种方法

#include<iostream>
#include<cstring>
#include<string>
using namespace std;
#define N 31

int main()
{
  long a,b,c,e,f,g;
  int n;
  cin>>n; 
  while(n--) 
  {
  	cin>>a>>b>>c>>e>>f>>g;
  
	  if(c+g<=59)
	  {
	  	c=c+g;
	  	if(b+f<=59)
	  	b=b+f;
	  	else
		  {
		  	 b=b+f+1-60;
		  	 a=a+e+1;
		  }
		  a=a+e;
	   }
	   else
	   {
	   		c=c+g-60;
			if(b+f+1<=59)
			{
				b=b+f+1;
				a=a+e;
			}
			else
			{	
			    b=b+f+1-60;
			    a=a+e+1;
			}
		}
		 cout<<a<<" "<<b<<" "<<c<<endl;
 }
}
方法2：本质一点的

#include
#include
#include
using namespace std;
#define N 31

int main()
{
long a[6];
int n;
cin>>n;
while(n–)
{
int i=0;
for(i=0;i<6;i++)
{
cin>>a[i];
}
for(i =2;i>0;i–)
{
a[i]+=a[i+3];
a[i-1]+=a[i]/60;
a[i]=a[i]%60;
}
a[i]+=a[i+3];
for(i=0;i<2;i++)
{
cout<<a[i]<<" ";
}
cout<<a[i]<<endl;

}
}