注册

某研究生不写论文竟研究起了算命？

起因


大约一个月前，在学校大病一场（不知道是不是🐑了，反正在学校每天核酸没检测出来）在宿舍休息了整整一周。当时因为发烧全身疼所以基本一直躺着刷刷视频。看了一周倪海厦老师讲的天纪，人纪感悟颇多，中华传统中一些优秀的东西竟然在现代教育下被丢失了而现在的人也只有在身体不得不休息的情况下才会停止内卷慢下来好好思考。


当然有人会说算命啥的都是封建迷信，作为接受了科学思想洗礼的新时代人慢慢也不再去接受那一套，在这里呢我不对这些想法做任何评价。信则有不信则无，存在即合理嘛。


因为疫情原因呢学校早早就给我们放了假，有了更多的空闲时间可以思考在学校没时间想的事情，做一些除开看论文、做项目之外的事


开始


前几天买的服务器刚好到家了，花了几天配置好环境（最重要的是花了大半天解决todesk、向日葵远程黑屏的问题）。今天下午写好代码丢到阳台让它自己慢慢训练去，剩下的时间就开始写今天关于算命的小程序。


六壬法


六壬法


留连速喜赤口
大安空亡小吉

根据倪师讲的，计算现在的农历日期加上时辰就可以推算当前某个想法适不适合去做。以大安开始每次从当宫开始顺时针数，下面是例子。



  • 假如今天是农历十二月十号 子时



  2. 首先从大安开始数1到12，结果是空亡




  3. 再从空亡开始数1到10，结果是速喜




  4. 然后从速喜开始子丑寅卯这样数，子是1




  5. 所以上面例子最后的结果就是速喜




计算过程都理解了怎么写成代码呢。这里需要知道三个条件，农历的月日以及当前的时辰，农历的月日这个地方我借鉴了这篇博客【C/C++】:用C实现输出日期的阴历日子直接复制了主要内容，打表直接计算农历日期，只需要输入当前阳历的年月日。


然后当前时间转为十二时辰也很简单，首先得到当前的小时时间hour，那么十二时辰就是(hour+1)/2<12?(hour+1)/2:0;这里子时记为0。


整个程序如下：


#include<iostream>
#include<string>
#include<ctime>
#include<vector>


std::vector<std::string> MAP{"大安","留连","速喜","赤口","小吉","空亡"};

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;  

}  

void output(int year,int month,int day,int &d_month,int &d_day)
{
const char *ChDay[] = {"*","初一","初二","初三","初四","初五",  
"初六","初七","初八","初九","初十",  
"十一","十二","十三","十四","十五",  
"十六","十七","十八","十九","二十",  
"廿一","廿二","廿三","廿四","廿五",  
"廿六","廿七","廿八","廿九","三十"  

                          };  
const char *ChMonth[] = {"*","正","二","三","四","五","六","七","八","九","十","十一","腊"};
char str[13] = "";
strcat(str,"农历"); 
if (LunarCalendar(year,month,day)){  
strcat(str,"闰"); 

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

    }  
else{

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

    } 
strcat(str,"月");  

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

}


int ChangeHourToPeriods(){
time_t now=time(0);
int hour;

    std::tm* t=std::localtime(&now);

    hour=(int)t->tm_hour;

    hour=(hour+1)/2<12?(hour+1)/2:0;
return hour;

}


int main(){
int year,month,day;

    std::cout<<"Please input the number of year,month,day:"<<std::endl;

    std::cin>>year>>month>>day;
int d_month=0,d_day=0;
output(year,month,day,d_month,d_day);
int hour=ChangeHourToPeriods();
int SumAll=d_month+d_day+hour-2;

    std::cout<<"The result is : "<<MAP[(SumAll%6)]<<std::endl;
return 0;

}

因为每次从当宫开始数也就每次都少数了1，但是由于最后子时以0开始所以只减2。


测试结果(测试的时间是21点亥时)
在这里插入图片描述


占卦法


占卦法


还有傅佩荣教授的三组三位数占卦法，这个更多就是易经中的内容太过于深奥，所以直接说计算方法。


三组三位数分别代表下卦，上卦和爻，卦象的三位数对8取余爻对6取余，如果整除就记为除数本身。


然后再去六十四卦中复制打表，最后得到卦象以及爻


整体实现如下


#include<iostream>
#include<string>
#include<vector>



std::vector<std::string> TRIGRAM=std::vector<std::string> {"乾","兑","离","震","巽","坎","艮","坤"};

std::vector<std::string> TRIGRAMMAP {
"乾为天","泽天夬","火天大有","雷天大壮","风天小畜","水天需","山天大畜","地天泰",
"天泽履","兑为泽","火泽睽","雷泽归妹","风泽中孚","水泽节","山泽损","地泽临",
"天火同人","泽火革","离为火","雷火丰","风火家人","水火既济","山火贲","地火明夷",
"天雷无妄","泽雷随","火雷噬嗑","震为雷","风雷益","水雷屯","山雷颐","地雷复",
"天风姤","泽风大过","火风鼎","雷风恒","巽为风","水风井","山风蛊","地风升",
"天水讼","泽水困","火水未济","雷水解","风水涣","坎为水","山水蒙","地水师",
"天山遁","泽山咸","火山旅","雷山小过","风山渐","水山蹇","艮为山","地山谦",
"天地否","泽地萃","火地晋","雷地豫","风地观","水地比","山地剥","坤为地"


};

int main(){
std::vector<int> LowToHigh(3);
std::vector<std::string> results(3);

    std::cout<<"Input 3*xxx like(111,222,333),means from up to high"<<std::endl;

for(int i=0;i<3;++i){

        std::cin>>LowToHigh[i];

    }


    LowToHigh[0]=LowToHigh[0]%8==0?8:LowToHigh[0]%8;

    LowToHigh[1]=LowToHigh[1]%8==0?8:LowToHigh[1]%8;

    LowToHigh[2]=LowToHigh[2]%6==0?6:LowToHigh[2]%6;



for(int i=0;i<2;++i){

        results[i]=TRIGRAM[LowToHigh[i]-1];

    }

    results[2]=std::to_string(LowToHigh[2]);


    std::cout<<"下卦:"<<results[0]<<" 上卦:"<<results[1]<<" "<<results[2]<<std::endl;

    std::cout<<"卦象: "<<TRIGRAMMAP[(LowToHigh[0]-1)*8+LowToHigh[1]-1]<<std::endl;

}

这里测试的例子是视频中的数字
在这里插入图片描述


结尾


有的时候真的需要一些自己的沉淀时间，不能忘了最初的目标。写这篇Blog也并不是为了宣传封建迷信，而是希望让更多程序圈的人想想当初我们喜欢敲代码到底是为了什么？我们喜欢的是将代码作为工具实现一些有趣的功能，并不是为了水论文或者工作被迫的去东拼西凑弄出一些用处不大的东西。


好多想吐槽的话最终还是打了又删，无法改变现状的时候只能屈服于现状，我相信不止我一人如此。但是请不要忘了 潜龙勿用见龙在田，终日乾乾飞龙在天


作者：shelgi
来源：juejin.cn/post/7176629565559685178
0
分享
2023-11-16

0 个评论

要回复文章请先登录或注册

一个开放、互助、协作、创意的社区

关于imGeek
关于专职工程师值守
社区财富榜
赞助商
友情链接
热门标签
京ICP备2023000793号