Quote:Original post by Nice Coder
Its the first thing i thought of. Great minds think alike, eh?

//In initmonth[0] = 31month[1] = 28month[2] = 30month[3] = 31month[4] = 30month[5] = 31month[6] = 30month[7] = 31month[8] = 30month[9] = 31month[10] = 30month[11] = 31// ...

This should be right. (i'm typing it strait into the box, so there might be a few errors).

// Made it more accurite
From,
Nice coder

month[0] = 31;month[1] = 28;month[2] = 31; // march is 31 daysmonth[3] = 30;month[4] = 31;month[5] = 30;month[6] = 31; // july is 31 daysmonth[7] = 31; // august is 31 days toomonth[8] = 30;month[9] = 31;month[10] = 30;month[11] = 31;

Quote:Original post by civguy
You should use cumulative months

Quote:Original post by civguy
and you should use different month-array for leap years

Quote:Original post by civguy
[1]. You should base the year length on the rules of computing leap years instead of sidereal year [2]. You should do pure integer math instead of float math to make sure you won't get errors due to lack of accuracy [3]. Ugh.

[1] Think about it, if just for a second. The way you're doing it now, the difference between January 1st and December 1st of same year will be 0 days.

[2] I'll go easy on you: 365 + 1/4 - 1/100 + 1/400 - 1/4000

[3] Just multiply the above summation by "year" without using floats. I know you can do it!

Quote:Original post by civguy

Quote:Original post by daerid
The only time you'd have to worry about leap years is when you're calling ToString() or something like that.

An accurate conversion from seconds to year,month and day is much harder though, than the conversion in another direction which has been discussed here.

Quote:Original post by Zahlman
Shouldn't the 'daysinmonth' be cumulative? o_O

const int daysUntilMonth[12] = {0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334};dayCount1 = (int)(year1 * 365.256) + daysUntilMonth[month1-1] + Days1;dayCount2 = (int)(year2 * 365.256) + daysUntilMonth[month2-1] + Days2;diff = dayCount2 - dayCount1;