clock

LED 圣诞树，圣诞节的礼物~多种颜色的LED灯装扮成闪闪发光的圣诞树(LED Christmas trees, Christmas gift- the colors of the LED lights to dress up as a shining Christmas tree)

说明：  魔王语言解释 具体要求参见《数据结构题集》P97,实习2.2中的描述。 用下述两条具体规则和上述规则形式（2）实现。设大写字母表示魔王语言的词汇；小写字母表示人的语言词汇；希腊字母表示可以用大写字母或小写字母代换的变量。魔王语言可含人的词汇。 （1）B->tAdA （2）A->sae (Beelzebub language to explain the specific requirements see the &quot Data Structure set title&quot P97, internship 2.2 description. 2 with the following specific rules and these rules form (2) implementation. Located in capital letters devil language vocabulary lowercase letters were the language vocabulary the Greek letters can be uppercase letters or lowercase letters substitution variables. Beelzebub language may contain human vocabulary. (1) B-&gt tAdA (2) A-&gt sae)

爱尔兰B公式的计算器，可以给定任意a，s，B中的2个，计算另一个，MFC(Ireland B formula calculator, you can determine the arbitrary a, s, B in two, another calculation, MFC)

小的计算器，适合初学者，虽然简陋了点，但很清楚(Calculator, suitable for beginners)

Easy to learn Visual Basic 6.0

AppWizard has created this WordAutomation application for you. This application not only demonstrates the basics of using the Microsoft Foundation classes but is also a starting point for writing your application.

利用上题的线性表，编程下列功能：假设以两个元素依值递增有序排列的线性表A和B 分别表示两个集合，现要求另辟空间构成一个线性表C，其元素为A和B元素的交集，且表C中的元素也是依值递增有序排列。(The use of the title of the linear form, programming the following features: Assuming two elements by incrementing the value ordered linear tables A and B represent two sets, are now required to open up space to form a linear table C, whose elements A and intersection B elements, and the elements in the table C is incremented by an orderly arrangement.)

公英制互转换器，初学VC时的小程序，对平时工程制图有些用处。(Metric to Imperial Units )

本程序实现构造任意阶幻方，输入数字构造你想要的幻方(The program to construct arbitrary magic square, magic square input digital structure you want)

说明：  /汉诺塔递归算法过程解析: //汉诺塔（又称河内塔）问题是印度的一个古老的传说。开天辟地的神勃拉玛在一个庙里留下了三根金刚石 //的棒，第一根上面套着64个圆的金片，最大的一个在底下，其余一个比一个小，依次叠上去，庙里的众僧 //不倦地把它们一个个地从这根棒搬到另一根棒上，规定可利用中间的一根棒作为帮助，但每次只能搬一个， //而且大的不能放在小的上面。解答结果请自己运行计算，程序见尾部。面对庞大的数字(移动圆片的次数) //18446744073709551615，看来，众僧们耗尽毕生精力也不可能完成金片的移动。 //后来，这个传说就演变为汉诺塔游戏:(err)