REGISTRY--simply-remove-WRITE-KEY

使用C++实现的小程序。计时器单位转换。输入为整型数单位为秒，输出格式为DDD：HH：MM：SS的时间。华为机试。(Use C++ achieve applet. Timer unit conversion. Enter an integer number of seconds, the output format is DDD: HH: MM: SS time. Huawei machine again.)

qt实现的遗传算法 解决最大最小值得问题 (qt genetic algorithm to achieve the maximum and minimum worth solving problems)

基本的光学知识，想学习光学的同学们可以看看的，呵呵(Basic optical knowledge of the students want to learn optics can see, the Hehe)

bin 格式转 hex 格式小程序，大家可以自己编译一下.(bin format to hex format applet, we can compile their own look.)

GDFtools2.3内部破解_梦幻古龙解包工具 带破解机在里面 告别授权版本 值得拥有!(GDFtools2.3 internal crack _ Dream Cologne unpack tool with crack machine inside farewell authorized version deserve!)

编写C程序，随机给出n*n的邻接矩阵，并打印输出邻接矩阵，以及有向图的边的个数，每个顶点的度，并判断该图中是否存在Euler回路： （1）如果为n阶，则随机产生一个n*n的邻接矩阵； （2）输出邻接矩阵，边的个数，每个顶点的度以及图中是否存在Euler回路。 这个题目涉及到了两个主要的知识点，一个是数据结构中的有向图的邻接矩阵的创建，还有就是离散数学中的Euler回路的判定定理。(The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then randomly generated a n* n adjacency matrix (2) output adjacency matrix, the number of edges, each vertex of degree as well as map the existence of Euler circuit. This topic relates to two main points of knowledge, a data structure of digraph adjacency matrix of creation, there is discrete mathematics in the loop to determine Euler theorem.)

mtouch pic16f887 the code is very perfet

很小很经典的一个游戏——取石子，一次只允许取1到3的整数，最后取走石子的一方失败。(A small classic games- from stone, to allow only take a 1-3 integer, and finally took away the stones of one loser.)

用于运动会的统计.分数,那女子参赛情况的记录统计.(Statistics for the Games. Scores, and that the situation of the women)

说明：  STM32F401RE的教学课程，有助于不了解STM32CubeMux的学生了解和使用，内含多个实验教程(STM32F401RE teaching course.)