节气计算

转载 2010年05月24日 08:31:00

一、节气的计算
  先给节气进行编号,从近日点开始的第一个节气编为0,编号如下及其相应的月份如下:

0 小寒 腊月

6  清明 三月

12 小暑 六月

18 寒露 九月

1 大寒 腊月

7  谷雨 三月

13 大暑 六月

19 霜降 九月

2 立春  正月

8  立夏 四月

14 立秋 七月

20 立冬 十月

3 雨水 正月

9  小满 四月

15 处暑 七月

21 小雪 十月

4 惊蛰 二月

10 芒种 五月

16 白露 八月

22 大雪 冬月

5 春分 二月

11 夏至 五月

17 秋分 八月

23 冬至 冬月

把当天和1900年1月0日(星期日)的差称为积日,那么第y年(1900年算第0年)第x 个节气的积日是
       F = 365.242 * y + 6.2 + 15.22 * x - 1.9 * sin(0.262 * x)
这个公式的误差在0.05天左右。
二、朔日的计算
  从1900年开始的第m个朔日的公式是
       M = 1.6 + 29.5306 * m + 0.4 * sin(1 - 0.45058 * m)
这个公式的误差在0.2天左右。
三、年份的确定
  1864年1月0日是农历癸亥年,所以用当年减去1864,用10除得的余数作为年份天干的,用12除得的余数作为年份的地支,数字对应的天干和地支如下。

数字

0

1

2

3

4

5

6

7

8

9

10

11

天干

 

 

地支

当年的1月0日换算为积日,可以用年份减去1900得到的年数被4整除,所得商数作为 y(D4),余数作为y(M4),y(M4)为零的年份是公历闰年,积日是
       D(1) = 1461 * y(D4) - 1
y(M4)不为零的年份是公历平年,积日是
       D(1) = 1461 * y(D4) + 365 * y(M4)
四、月份的确定
  计算前一年冬至的积日F(0),并用F(0)计算冬至所在的朔月m及其朔日M(0),就可以推算冬至的农历日期,冬至所在的农历月份总是十一月。计算下一个中气F(1)和下一个朔日M(1),如果F(1)<M(1),那么该月就是上一个月的闰月,并把这个中气作为F(2),以后的中气、朔日和农历月份也这样确定。

 

 

                                                       计算某天是星期几【C代码】

#include <time.h>

/*

函数名称:int GetWeekDay(int year,int month,int day)

函数功能: 返回输入日期对应的一周中的第几天。

函数参数:year 输入日期的年;month 输入日期的月;day输入日期的日

         如:2000年1月1日则是GetWeekDay(2000,1,1)

*/

int GetWeekDay(int year,int month,int day)

{

    int i,j,count=0;

    int Day_Index;

    int days[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};

    int MonthAdd[12] = {0,31,59,90,120,151,181,212,243,273,304,334};

#if 0

    for(i = 1;i < month;i++)

       count = count + days[i];

#else

    count = MonthAdd[month-1];

#endif

    count = count + day;

    if((year%4 == 0&&year %100 != 0||year % 400 == 0)&& month >= 3)

       count += 1;

    count = count + (year - 1901) * 365;

    for(j = 1901;j < year;j++)

    {

       if(j % 4 == 0 && j % 100 != 0 || j % 400 == 0)

           count++;

    }

    return ((count+1) % 7);

}

main()

{

    const char *Week[]={"星期日","星期一","星期二","星期三","星期四","星期五","星期六"};

    struct tm * Local;

    long t;

    int year,month,day;

#if 0

    //下面仅仅是拿当前的日期作为计算,当然你也可以用来计算其他的日期。

    //如:2000年1月1日则是GetWeekDay(2000,1,1)

    t = time(NULL);

    Local = localtime(&t);

    year = Local->tm_year + 1900;

    month = Local->tm_mon + 1;

    day = Local-> tm_mday;

    printf("%d年%d月%d日/t",year,month,day);

    puts(Week[GetWeekDay(year,month,day)]);

    //下面是访问tm结构体来得到当前是星期几

    printf("%d年%d月%d日/t",year,month,day);

    puts(Week[Local->tm_wday]);

#else

    year = 2006;

    month = 10;

    day = 1;

    printf("%d年%d月%d日/t",year,month,day);

    puts(Week[GetWeekDay(year,month,day)]);

#endif

    system("pause");

}

 

 

                                  农历中天干地支的计算【C代码】

 

/*

 

函数名称:int GetChineseEra(int year,int flag)

函数功能: 返回某年对应的天干和地支。

flag = 0 返回天干 flag = 1 返回 地支。

函数参数:year 要查询的年;如:1984年,

         天干:GetChineseEra(1984,0)

         地支:GetChineseEra(1984,1)

*/

unsigned int LunarCalendarTable[199] = {

    0x04AE53,0x0A5748,0x5526BD,0x0D2650,0x0D9544,0x46AAB9,0x056A4D,0x09AD42,0x24AEB6,0x04AE4A,/*1901-1910*/

    0x6A4DBE,0x0A4D52,0x0D2546,0x5D52BA,0x0B544E,0x0D6A43,0x296D37,0x095B4B,0x749BC1,0x049754,/*1911-1920*/

    0x0A4B48,0x5B25BC,0x06A550,0x06D445,0x4ADAB8,0x02B64D,0x095742,0x2497B7,0x04974A,0x664B3E,/*1921-1930*/

    0x0D4A51,0x0EA546,0x56D4BA,0x05AD4E,0x02B644,0x393738,0x092E4B,0x7C96BF,0x0C9553,0x0D4A48,/*1931-1940*/   

    0x6DA53B,0x0B554F,0x056A45,0x4AADB9,0x025D4D,0x092D42,0x2C95B6,0x0A954A,0x7B4ABD,0x06CA51,/*1941-1950*/

    0x0B5546,0x555ABB,0x04DA4E,0x0A5B43,0x352BB8,0x052B4C,0x8A953F,0x0E9552,0x06AA48,0x7AD53C,/*1951-1960*/

    0x0AB54F,0x04B645,0x4A5739,0x0A574D,0x052642,0x3E9335,0x0D9549,0x75AABE,0x056A51,0x096D46,/*1961-1970*/

    0x54AEBB,0x04AD4F,0x0A4D43,0x4D26B7,0x0D254B,0x8D52BF,0x0B5452,0x0B6A47,0x696D3C,0x095B50,/*1971-1980*/

    0x049B45,0x4A4BB9,0x0A4B4D,0xAB25C2,0x06A554,0x06D449,0x6ADA3D,0x0AB651,0x093746,0x5497BB,/*1981-1990*/

    0x04974F,0x064B44,0x36A537,0x0EA54A,0x86B2BF,0x05AC53,0x0AB647,0x5936BC,0x092E50,0x0C9645,/*1991-2000*/

    0x4D4AB8,0x0D4A4C,0x0DA541,0x25AAB6,0x056A49,0x7AADBD,0x025D52,0x092D47,0x5C95BA,0x0A954E,/*2001-2010*/

    0x0B4A43,0x4B5537,0x0AD54A,0x955ABF,0x04BA53,0x0A5B48,0x652BBC,0x052B50,0x0A9345,0x474AB9,/*2011-2020*/

    0x06AA4C,0x0AD541,0x24DAB6,0x04B64A,0x69573D,0x0A4E51,0x0D2646,0x5E933A,0x0D534D,0x05AA43,/*2021-2030*/

    0x36B537,0x096D4B,0xB4AEBF,0x04AD53,0x0A4D48,0x6D25BC,0x0D254F,0x0D5244,0x5DAA38,0x0B5A4C,/*2031-2040*/

    0x056D41,0x24ADB6,0x049B4A,0x7A4BBE,0x0A4B51,0x0AA546,0x5B52BA,0x06D24E,0x0ADA42,0x355B37,/*2041-2050*/

    0x09374B,0x8497C1,0x049753,0x064B48,0x66A53C,0x0EA54F,0x06B244,0x4AB638,0x0AAE4C,0x092E42,/*2051-2060*/

    0x3C9735,0x0C9649,0x7D4ABD,0x0D4A51,0x0DA545,0x55AABA,0x056A4E,0x0A6D43,0x452EB7,0x052D4B,/*2061-2070*/

    0x8A95BF,0x0A9553,0x0B4A47,0x6B553B,0x0AD54F,0x055A45,0x4A5D38,0x0A5B4C,0x052B42,0x3A93B6,/*2071-2080*/

    0x069349,0x7729BD,0x06AA51,0x0AD546,0x54DABA,0x04B64E,0x0A5743,0x452738,0x0D264A,0x8E933E,/*2081-2090*/

    0x0D5252,0x0DAA47,0x66B53B,0x056D4F,0x04AE45,0x4A4EB9,0x0A4D4C,0x0D1541,0x2D92B5          /*2091-2099*/

};

int MonthAdd[12] = {0,31,59,90,120,151,181,212,243,273,304,334};

int GetLunarYear(int year,int month,int day)

{

    int Spring_NY,Sun_NY,StaticDayCount;

    int index,flag;

 

    //Spring_NY 记录春节离当年元旦的天数。

    //Sun_NY 记录阳历日离当年元旦的天数。

    if( ((LunarCalendarTable[year-1901] & 0x0060) >> 5) == 1)

 

        Spring_NY = (LunarCalendarTable[year-1901] & 0x001F) - 1;

    else

        Spring_NY = (LunarCalendarTable[year-1901] & 0x001F) - 1 + 31;

 

    Sun_NY = MonthAdd[month-1] + day - 1;

 

    if( (!(year % 4)) && (month > 2))

 

        Sun_NY++;

   

    if(Sun_NY >= Spring_NY)

       return year;

    else

       return year - 1;

}

int GetChineseEra(int year,int flag)

{

   if(flag == 0)

      return ((year - 4) % 60) % 10;

   else

      return ((year - 4) % 60) % 12;

}

#include <time.h>

main()

{

    const char *AnimalSign[] =

{"鼠","牛","虎","兔","龙","蛇","马","羊","猴","鸡","狗","猪"};

    const char *TianGan[] =

{"甲","乙","丙","丁","戊","己","庚","辛","壬","癸"};

    const char *DiZhi[] =

{"子","丑","寅","卯","辰","巳","午","未","申","酉","戌","亥"};

 

    char Era[4];

    int LunarYear,year,month,day;

    struct tm * Local;

    long t;

    t = time(NULL);

    Local = localtime(&t);

   

    year = Local->tm_year + 1900;

    month = Local->tm_mon + 1;

    day = Local->tm_mday;

    LunarYear = GetLunarYear(year,month,day);

    printf("%d年%d月%d日/n",year,month,day);

   

    strcpy(Era,TianGan[GetChineseEra(LunarYear,0)]);

    strcat(Era,DiZhi[GetChineseEra(LunarYear,1)]);

    puts(Era);

    puts(AnimalSign[GetChineseEra(LunarYear,1)]);

 

    printf("**********************************************/n");

   

    year = 2007;

    month = 2;

    day = 17;

    LunarYear = GetLunarYear(year,month,day);

    printf("%d年%d月%d日/n",year,month,day);

 

    strcpy(Era,TianGan[GetChineseEra(LunarYear,0)]);

    strcat(Era,DiZhi[GetChineseEra(LunarYear,1)]);

    puts(Era);

    puts(AnimalSign[GetChineseEra(LunarYear,1)]);

 

    printf("**********************************************/n");

   

    year = 2007;

    month = 2;

    day = 18;

    LunarYear = GetLunarYear(year,month,day);

    printf("%d年%d月%d日/n",year,month,day);

 

    strcpy(Era,TianGan[GetChineseEra(LunarYear,0)]);

    strcat(Era,DiZhi[GetChineseEra(LunarYear,1)]);

    puts(Era);

    puts(AnimalSign[GetChineseEra(LunarYear,1)]);

    system("pause");

}

 

     农历一百年算法(1921~2021)【C语言代码】

 

 

/*

  下面是网上一个非常流行的计算农历的算法和C代码。但是,它只能计算

  1921年 到 2021年的农历,仅仅只有一百年。稍后,我将会帖出农历两百年算法(1901~2100)【C语言代码】

*/

#include <time.h>

int LunarCalendar(int year,int *pmonth,int *pday)

{

    const int MonthAdd[12] = {0,31,59,90,120,151,181,212,243,273,304,334};

    const int LunarCalendarTable[100] ={

                                2635,333387,1701,1748,267701,694,2391,133423,1175,396438

                            ,3402,3749,331177,1453,694,201326,2350,465197,3221,3402

                            ,400202,2901,1386,267611,605,2349,137515,2709,464533,1738

                            ,2901,330421,1242,2651,199255,1323,529706,3733,1706,398762

                            ,2741,1206,267438,2647,1318,204070,3477,461653,1386,2413

                            ,330077,1197,2637,268877,3365,531109,2900,2922,398042,2395

                            ,1179,267415,2635,661067,1701,1748,398772,2742,2391,330031

                            ,1175,1611,200010,3749,527717,1452,2742,332397,2350,3222

                            ,268949,3402,3493,133973,1386,464219,605,2349,334123,2709

                            ,2890,267946,2773,592565,1210,2651,395863,1323,2707,265877};

 

    int DateCount,loop;

    int i,j,n,Bit;

    int month,day;

    month = *pmonth;

    day = *pday;

    //计算从1921年2月8日(正月初一)到现在所经历的天数。

    DateCount = (year - 1921) * 365 + (year - 1921) / 4 + MonthAdd[month - 1] - 38 + day;

 //如今年阳历是闰年(2月有29天),而且当前月份大于2月,经历的总天数加1。

    if((!(year % 4)) && (month > 2))

       DateCount = DateCount + 1;

    //下面是查表的算法。

    loop = 1;

    j = 0;

    while(loop)

    {

       if(LunarCalendarTable[j] < 4095)

           i = 11;

       else

           i = 12;

       n = i;

       while(n>=0)

       {

           Bit = LunarCalendarTable[j];

           Bit = (Bit >> n) & 1;

           if (DateCount <= (29 + Bit))

           {

              loop = 0;

              break;

           }

           DateCount -= 29 + Bit;

           n--;

       }

       if(!loop)

           break;

       j++;

    }

    year = 1921 + j;

    month = i - n + 1;

    day = DateCount;

    if (i == 12)

    {

       if (month == LunarCalendarTable[j] / 65536 + 1)

       {

           month = 1 - month;

       }

       else if (month > LunarCalendarTable[j] / 65536 + 1)

           month--;

    }

    *pmonth = month;

    *pday = day;

    return 1;

}

main()

{

    const char *ChDay[] = {"*","初一","初二","初三","初四","初五",

                          "初六","初七","初八","初九","初十",

                          "十一","十二","十三","十四","十五",

                          "十六","十七","十八","十九","二十",

                          "廿一","廿二","廿三","廿四","廿五",

                          "廿六","廿七","廿八","廿九","三十"};

    const char *ChMonth[] = {"*","正","二","三","四","五","六","七","八","九","十","十一","腊"};

    struct tm * Local;

    long t;

    int year,month,day;

    char str[13] = "";

 

#if 0   

    t = time(NULL);

    Local = localtime(&t);

    year = Local->tm_year + 1900;

    month = Local->tm_mon + 1;

    day = Local-> tm_mday;

#else

    year = 2006;

    month = 1;

    day = 1;

#endif

    printf("%d年%d月%d日/t",year,month,day);

    LunarCalendar(year,&month,&day);

    if(month < 0)

    {

       strcat(str,"闰");

       strcat(str,ChMonth[-month]);

    }

    else

       strcat(str,ChMonth[month]);

    strcat(str,"月");

    strcat(str,ChDay[day]);

    puts(str);

    system("pause");

}

 

     农历两百年算法(1901~2100)【C语言代码】

   

下面的三个表格是农历数据表 LunarCalendarTable 的结构。总共使用了32位整数的0~23位。


6

5

4

3

2

1

0

表示春节的公历月份

表示春节的公历日期

 

19

18

17

16

15

14

13

12

11

10

9

8

7

1

2

3

4

5

6

7

8

9

10

11

12

13

农历1-13 月大小 。月份对应位为1,农历月大(30 天),为0 表示小(29 天)

 

23

22

21

20

表示当年闰月月份,值为0 为则表示当年无闰月。

 

#include <time.h>

unsigned int LunarCalendarDay;

unsigned int LunarCalendarTable[199] = {

    0x04AE53,0x0A5748,0x5526BD,0x0D2650,0x0D9544,0x46AAB9,0x056A4D,0x09AD42,0x24AEB6,0x04AE4A,/*1901-1910*/

    0x6A4DBE,0x0A4D52,0x0D2546,0x5D52BA,0x0B544E,0x0D6A43,0x296D37,0x095B4B,0x749BC1,0x049754,/*1911-1920*/

    0x0A4B48,0x5B25BC,0x06A550,0x06D445,0x4ADAB8,0x02B64D,0x095742,0x2497B7,0x04974A,0x664B3E,/*1921-1930*/

    0x0D4A51,0x0EA546,0x56D4BA,0x05AD4E,0x02B644,0x393738,0x092E4B,0x7C96BF,0x0C9553,0x0D4A48,/*1931-1940*/   

    0x6DA53B,0x0B554F,0x056A45,0x4AADB9,0x025D4D,0x092D42,0x2C95B6,0x0A954A,0x7B4ABD,0x06CA51,/*1941-1950*/

    0x0B5546,0x555ABB,0x04DA4E,0x0A5B43,0x352BB8,0x052B4C,0x8A953F,0x0E9552,0x06AA48,0x6AD53C,/*1951-1960*/

    0x0AB54F,0x04B645,0x4A5739,0x0A574D,0x052642,0x3E9335,0x0D9549,0x75AABE,0x056A51,0x096D46,/*1961-1970*/

    0x54AEBB,0x04AD4F,0x0A4D43,0x4D26B7,0x0D254B,0x8D52BF,0x0B5452,0x0B6A47,0x696D3C,0x095B50,/*1971-1980*/

    0x049B45,0x4A4BB9,0x0A4B4D,0xAB25C2,0x06A554,0x06D449,0x6ADA3D,0x0AB651,0x093746,0x5497BB,/*1981-1990*/

    0x04974F,0x064B44,0x36A537,0x0EA54A,0x86B2BF,0x05AC53,0x0AB647,0x5936BC,0x092E50,0x0C9645,/*1991-2000*/

    0x4D4AB8,0x0D4A4C,0x0DA541,0x25AAB6,0x056A49,0x7AADBD,0x025D52,0x092D47,0x5C95BA,0x0A954E,/*2001-2010*/

    0x0B4A43,0x4B5537,0x0AD54A,0x955ABF,0x04BA53,0x0A5B48,0x652BBC,0x052B50,0x0A9345,0x474AB9,/*2011-2020*/

    0x06AA4C,0x0AD541,0x24DAB6,0x04B64A,0x69573D,0x0A4E51,0x0D2646,0x5E933A,0x0D534D,0x05AA43,/*2021-2030*/

    0x36B537,0x096D4B,0xB4AEBF,0x04AD53,0x0A4D48,0x6D25BC,0x0D254F,0x0D5244,0x5DAA38,0x0B5A4C,/*2031-2040*/

    0x056D41,0x24ADB6,0x049B4A,0x7A4BBE,0x0A4B51,0x0AA546,0x5B52BA,0x06D24E,0x0ADA42,0x355B37,/*2041-2050*/

    0x09374B,0x8497C1,0x049753,0x064B48,0x66A53C,0x0EA54F,0x06B244,0x4AB638,0x0AAE4C,0x092E42,/*2051-2060*/

    0x3C9735,0x0C9649,0x7D4ABD,0x0D4A51,0x0DA545,0x55AABA,0x056A4E,0x0A6D43,0x452EB7,0x052D4B,/*2061-2070*/

    0x8A95BF,0x0A9553,0x0B4A47,0x6B553B,0x0AD54F,0x055A45,0x4A5D38,0x0A5B4C,0x052B42,0x3A93B6,/*2071-2080*/

    0x069349,0x7729BD,0x06AA51,0x0AD546,0x54DABA,0x04B64E,0x0A5743,0x452738,0x0D264A,0x8E933E,/*2081-2090*/

    0x0D5252,0x0DAA47,0x66B53B,0x056D4F,0x04AE45,0x4A4EB9,0x0A4D4C,0x0D1541,0x2D92B5          /*2091-2099*/

};

int MonthAdd[12] = {0,31,59,90,120,151,181,212,243,273,304,334};

int LunarCalendar(int year,int month,int day)

{

    int Spring_NY,Sun_NY,StaticDayCount;

    int index,flag;

 

    //Spring_NY 记录春节离当年元旦的天数。

    //Sun_NY 记录阳历日离当年元旦的天数。

    if( ((LunarCalendarTable[year-1901] & 0x0060) >> 5) == 1)

        Spring_NY = (LunarCalendarTable[year-1901] & 0x001F) - 1;

    else

        Spring_NY = (LunarCalendarTable[year-1901] & 0x001F) - 1 + 31;

    Sun_NY = MonthAdd[month-1] + day - 1;

    if( (!(year % 4)) && (month > 2))

        Sun_NY++;

   

    //StaticDayCount记录大小月的天数 29 或30

    //index 记录从哪个月开始来计算。

    //flag 是用来对闰月的特殊处理。

 

 

    //判断阳历日在春节前还是春节后

 

    if (Sun_NY >= Spring_NY)//阳历日在春节后(含春节那天)

    {

        Sun_NY -= Spring_NY;

        month = 1;

        index = 1;

        flag = 0;

        if( ( LunarCalendarTable[year - 1901] & (0x80000 >> (index-1)) ) ==0)

            StaticDayCount = 29;

        else

            StaticDayCount = 30;

        while(Sun_NY >= StaticDayCount)

        {

            Sun_NY -= StaticDayCount;

            index++;

            if(month == ((LunarCalendarTable[year - 1901] & 0xF00000) >> 20) )

            {

                flag = ~flag;

                if(flag == 0)

                    month++;

            }

            else

                month++;

            if( ( LunarCalendarTable[year - 1901] & (0x80000 >> (index-1)) ) ==0)

                StaticDayCount=29;

            else

                StaticDayCount=30;

        }

        day = Sun_NY + 1;

    }

    else//阳历日在春节前

    { 

        Spring_NY -= Sun_NY;

        year--;

        month = 12;

        if ( ((LunarCalendarTable[year - 1901] & 0xF00000) >> 20) == 0)

            index = 12;

        else

            index = 13;

        flag = 0;

        if( ( LunarCalendarTable[year - 1901] & (0x80000 >> (index-1)) ) ==0)

            StaticDayCount = 29;

        else

            StaticDayCount = 30;

        while(Spring_NY > StaticDayCount)

        {

            Spring_NY -= StaticDayCount;

            index--;

            if(flag == 0)

                month--;

            if(month == ((LunarCalendarTable[year - 1901] & 0xF00000) >> 20))

                flag = ~flag;

            if( ( LunarCalendarTable[year - 1901] & (0x80000 >> (index-1)) ) ==0)

                StaticDayCount = 29;

            else

                StaticDayCount = 30;

         }

         day = StaticDayCount - Spring_NY + 1;

    }

    LunarCalendarDay |= day;

    LunarCalendarDay |= (month << 6);

    if(month == ((LunarCalendarTable[year - 1901] & 0xF00000) >> 20))

        return 1;

    else

        return 0;

}

main()

{

    const char *ChDay[] = {"*","初一","初二","初三","初四","初五",

                          "初六","初七","初八","初九","初十",

                          "十一","十二","十三","十四","十五",

                          "十六","十七","十八","十九","二十",

                          "廿一","廿二","廿三","廿四","廿五",

                          "廿六","廿七","廿八","廿九","三十"};

    const char *ChMonth[] = {"*","正","二","三","四","五","六","七","八","九","十","十一","腊"};

   

    struct tm * Local;

    long t;

    int year,month,day;

    char str[13] = "";

 

#if 0   

    t = time(NULL);

    Local = localtime(&t);

    year = Local->tm_year + 1900;

    month = Local->tm_mon + 1;

    day = Local-> tm_mday;

#else

    year = 2006;

    month = 9;

    day = 9;

#endif

    printf("%d年%d月%d日/t",year,month,day);

    if(LunarCalendar(year,month,day))

    {

        strcat(str,"闰");

        strcat(str,ChMonth[(LunarCalendarDay & 0x3C0) >> 6]);

    }

    else

        strcat(str,ChMonth[(LunarCalendarDay & 0x3C0) >> 6]);

    strcat(str,"月");

    strcat(str,ChDay[LunarCalendarDay & 0x3F]);

    puts(str);

    system("pause");

}

 

 

 

网络工程师系统可靠性计算强化训练教程

网络工程师考试考察知识点繁多,形式多样。如何有效把握每种考察形式,拿到相应分数?这是历年考生最挠头的事情。本系列课程紧抓考生痛点,对网工考试中重点题型分门别类讲解,反复强化训练,助力考生查缺补漏,拿到相应分数。本次分课程重点讲解了系统可靠性的计算方法。通过基本概念阐述->历年真题强化训练->独家解题技巧总结,三大步骤帮助考生掌握系统可靠性的计算方法,拿到相应分数。
  • 2016年07月11日 09:56

java实现二十四节气计算

博客分类:  java java二十四节气二十四节气公式C值  import java.util.HashMap;  import java.util.Map;  /**  ...
  • ccwang0331
  • ccwang0331
  • 2016-05-03 14:15:56
  • 1550

比较精确的计算农历节气的java源码

在网上找了好多计算农历节气的java源码,有好多都有误差,另外靠存储查找的方法终究不靠谱。 最近在“绿色冰点”的博客上看到了关于“寿星万年历---java算法实现”的博文,挺不错,转载一下。 ...
  • Alex_15
  • Alex_15
  • 2017-03-18 20:17:39
  • 1634

java计算24节气

  • 2013年04月15日 07:50
  • 12KB
  • 下载

java公历转农历及计算节气的工具类

  • 2012年11月02日 10:47
  • 11KB
  • 下载

农历、节气、节日算法

[java] view plain copy /**   * @(#)Lunar.java 2008-4-5 2:06:22   */   package luoz...
  • qq_18944923
  • qq_18944923
  • 2016-09-21 16:32:40
  • 1012

java 实现二十四节气

直接贴代码public class _24SolarTerms { private static final double D = 0.2422; private final stat...
  • Sun_LeiLei
  • Sun_LeiLei
  • 2015-12-02 14:54:07
  • 1570

JS完美农历、二十四节气的、可查询的万年历万年历

  • 2013年04月21日 13:09
  • 11KB
  • 下载

[转]天文方法计算二十四节气

转自吹泡泡的小猫,原文地址:http://blog.csdn.net/orbit/article/details/7910220         二十四节气在中国古代历法中扮演着非常重要的角色,本...
  • yimianshuiyue
  • yimianshuiyue
  • 2015-06-03 14:14:28
  • 2035

24节气算法

import java.util.Calendar; import java.util.HashMap; import java.util.Map; /** *describe:24节气 * ...
  • bingdongguke
  • bingdongguke
  • 2016-08-03 15:12:01
  • 1021
收藏助手
不良信息举报
您举报文章:节气计算
举报原因:
原因补充:

(最多只允许输入30个字)