int leap (int year) {	if (year % 400 == 0) {		return 1;	else if (year % 4 == 0) {		return 1;	else		return 0;}int dayInYear (int month, int day, int year) {	int totalDays = 0;	int monthsWithThirtyDays [4] = {4, 6, 9, 11};	// Test for days above 28 or 29 (depending if leap year) in February.	if (month == 2 && day > 28 + leap (year)) {		return -1;	}		// If the month is past February, then make sure we subtract from the         // assumed 31	// days in a month so that we have 28 or 29 days instead.	if (month > 2) 		totalDays = (totalDays - 3) + leap (year);	// Loop through the months with thirty days. 	for (int n = 0; n < 4; n++) {		// If the month matches one of them and the day is above 30,                            // exit.		if (month == monthsWithThirtyDays[n] && day > 30)			return -1;		// If the month is greater than one of the exceptions,		// then subtract one from the total.		if (month > monthsWithThirtyDays[n])			totalDays--;	}		// Assume all months have 31 days and calculate totalDays. The         // algorithms above should	// make the totalDays number negative because of the correction on the         // assumption that every month has 31 days.	totalDays = totalDays + (month - 1) * 31 + day;		return totalDays;}