#include <iostream>
#include <string.h>
#include <fstream>
#include <ctime>

using namespace std;

struct date{
	int day, mon, year;
};

void inputDate(){
	int n;
	cout << "Enter number of elements:\n";
	cin >> n;
	date* a = new date[n];
	cout << "Enter value:(day mon year)\n";
	for (int i = 0; i < n; ++i)
		cin >> a[i].day >> a[i].mon >> a[i].year;
	cout << "Enter output file name:\n";
	char file[30];
	gets_s(file, 29);
	ofstream f(file, ios::binary);
	if (!f.is_open()) return;
	f.write((char*)&n, 4);
	f.write((char*)a, 4 * n);	
	f.close();
}

bool isLeapYear(int n){
	if (n % 4 != 0 || (n % 100 == 0 && n % 400 != 0)) return false;
	return true;
}

int sumMon(int mon, bool leapYear){
	switch (mon)
	{
	case 1: case 3: case 5: case 7: case 8: case 10: case 12: {
		return mon * 31;
	}
	case 2: if (leapYear) return mon * 29;
			else return mon * 28;
	case 4: case 6: case 9: case 11:
		return mon * 30;

	default:
		return 0;
	}
}

int dayGap(date a, date b){
	date sub;
	sub.year = a.year - b.year;
	sub.mon = a.mon - b.mon;
	sub.day = a.day - b.day;
	int sum = 365 * sub.year;

}

void theNewestDay(date* a, int n){
	time_t now = time(0);
	tm* t = localtime(&now);

	date org;
	org.day = t->tm_mday;
	org.mon = t->tm_mon;
	org.year = t->tm_year;


}

int main(){
	
	return 0;
}