一个J2ME计算万年历的简单程序.docxVIP

A simple program to calculate calendar Author: Li Geng Usually, we only know the days before and after the day of the week, and even when we look at the calendar, we can only know the number of days with limited dates? So, is there a way to let us know what day it is? Yes, I would like to introduce a method for writing calendar programs? First, we have to agree on some rules? We use Y, M, and D to represent years, months, and days, respectively. Sunday and Saturday are represented by numbers 0~6, so that we can start to deduce our formula? We know that September 1, 2002 is Sunday, and if we want to know what the week of September 10, 2002 is, we can count as follows: (0+ (10-1))%7 = (0+9)%7 = 2, that is Tuesday. The same can be considered as September 20, 2002: (0+ (20-1))%7 二(0+19)%7 = 5, that is, Friday. But this is the need to date by 1, is not very convenient, in order to solve this problem, we can assume that each month with a number 0, since September 1, 2002 is a Sunday, then September 0, 2002 is a Saturday, this is September 10th, only by 10 (6+10)%7 = 2. In fact, in September Oth, August 31st, the number of weeks on the 0 day of each month was actually the number of days before the 1 day of the month? I call this week the code for each month? With this code, it will be easy to count the number of days per month this month. The code for each month of the year is discussed? In fact, there is also a code for each year? The code is the number of weeks per January Oth (the day before January 1st), that is, the code in Januar y. If we can find the relati on ship between each of the code, then makes it easy to compute the calendar? (I) code formula for reckoning years As we all know, there are 365 days a year, 52 weeks and 1 days? Leap year is 366 days, or 52 weeks, more than 2 days? We only consider the first year? Assuming that the code for N is W, then the code for N+l is%7 (W+l), and the N+K code is (W+K)%7? This is because from the N to the N+K years after K