fjnu 1684 Clock

Description

You are given a standard 12-hour clock with analog display, an hour hand and a minute hand. How many times does the minute hand pass the hour hand in a given time interval?

Input

The input contains an indefinite number of lines; each line contains four numbers. The first pair of numbers represents an "initial time" the second pair represents a "final time." In each such number pair, the first number represents hours, second number represents minutes. The hours will be in the range 1..12, the minutes in the range 0..59. No initial time and no final time will be an instant at which the minute hand just passes the hour hand. (In particular, 12 00 will not occur as an initial or final time.) No initial time will be the same as the corresponding final time. Between each initial time and corresponding final time, the hour hand will have turned less than one full revolution (360 degrees). As the hour hand turns from its initial position to its final position, it may or may not sweep past the number 12 on the clock's dial. If it does, then either the initial time is an "A.M." time and the final time a "P.M." time, or vice versa. If it does not, then either both times (initial and final) are "A.M." or both are "P.M."

Output

Each line of input gives rise to one line of output, containing the initial and final times, and the number of times the minute hand passes the hour hand between the initial time and the final time. Observe all details of formatting, such as upper/lower case letters, punctuation, blank spaces, and the absence of blank lines. In each time display, the hours and minutes are displayed in fields of width 2, separated by a colon. The ten's digit (of hours or minutes) is displayed as a zero if it is zero.

Sample Input

Sample Output

Hint

Here is a formatting template shown between two lines of the above output:

12345678901234567890123456789012 12:50 01:02 0

KEY:首先要明白，要使分针超过时针，必然要有重合的时刻，先算出这些时刻，然后就好办

Source:



#include

using namespace std;



struct node 

{

	int hour;

	int minute;

};



node f[25];

node s,e;



void GetList()

{

	int i,j=0;

	for(i=0;i<=11;i++,j++)

	{

		f[i].hour=i;

		f[i].minute=60.0/11*j;

	}

	for(j=1;i<=23;i++,j++)

	{

		f[i].hour=i+1;

		f[i].minute=60.0/11*j;

	}

}



int timecompare(node x,node y)

{

	if(x.hour>y.hour) return 1;

	else

	{

		if(x.hour==y.hour)

		{

			if(x.minute>y.minute) return 1;

			else return 0;

		}

		else return 0;

	}

}



int countpass()

{

	int passed=0;

	if(timecompare(s,e))

	{

		e.hour+=12;

	}

	int spos,epos;

	int i;

	for(i=0;i<=24;i++)

	{

		if(!timecompare(s,f[i])) break;

	}

	spos=i;

	for(i=0;i<=24;i++)

	{

		if(!timecompare(e,f[i])) break;

	}

	epos=i-1;

	return epos-spos+1;

}



int  main()

{

//	freopen("fjnu_1684.in","r",stdin);

	GetList();

	cout<<"Program 3 by team X"<>s.hour>>s.minute>>e.hour>>e.minute)

	{

		cout<<"       ";

		if(s.hour<10) cout<<"0";

		cout<