MC9S12XS128changyongmokuai

cy7c68001驱动程序，主要用于这个usb芯片的驱动(CY7C68001 driver chips used mainly for the usb driver)

根据对应的按键值，对应输出相应的电容值，并做掉电检测(According to the corresponding key value, corresponding to the output of the corresponding capacitance values ​ ​ and do brownout detection)

基于STM32的直流无刷电机控制程序，带霍尔传感器(Brushless DC motor control procedures)

虚拟串口，在Proteus中可用实际串口与其通信(Virtual serial port, available at Proteus its actual serial communication)

软件是一款基于Microsoft Visual Basic 软件开发的物理化学实验数据处理软件，共分为八个实验，分别是”恒温槽的装配与性能测试”，“液体的饱和蒸汽压测定”，“双液系气液相平衡图的绘制”，“蔗糖转化反应速率常数的测定”，“电动势测定及应用”，“乙酸乙酯皂化反应动力学”，“最大气泡法测定液体表面张力”，“吊环法测定液体表面张力”。(Software is a Microsoft Visual Basic software development based on the physical and chemical experimental data processing software, is divided into eight experiments are " bath assembly and performance testing" , " liquid saturated vapor pressure measurement" , " two-fluid system phase equilibrium diagram drawing " ," invertase reaction rate constants measured, " " Determination and application of force " ," ethyl acetate saponification reaction kinetics " ," Determination of the maximum bubble liquid surface tension, " " Determination of the rings liquid surface tension. " )

说明：  51单片机的拼音输入法的程序，用C实现，(51 SCM Pinyin input method to the procedures used to achieve C,)

本节所给出主程序功能为51单片机从USB总线读取两个字节数据，计算两个数据的和。另外本文还给出了CH372的主端点、辅助端点之间数据上传下传的子程序，供读者参考。(The main function of this section is given as 51 microcontroller reads the two bytes of data the USB bus, two data and computing. This article also gives additional primary endpoint between the auxiliary endpoints CH372 Uploaded data transfer routines, for reference)

YL_3串行数码管显示时钟，74HC595，8位，显示时分秒，自动计数。(YL_3 serial digital display clock, 74HC595, 8 bit display minutes and seconds, automatic counting.)

通过单片机输入程序来对步进电机进行控制，以此实现一定功能。(Stepping motor single chip microcomputer)

一个数字梯形，选择k条路线，每条路线从第一层的某个数开始，每次进入下一层到达左下或者右下的数字，直到最后一层为止。每条路线不能经过相同的路径，但是可以经过相同的数字节点。 输出一个整数，表示能得到的最大的k条路径经过的数字之和(A digital ladder, the K route, each route the first layer of a number, each time to enter the next layer to reach the left or right next to the number, until the final layer. Each route can not pass through the same path, but can pass through the same number of nodes. Output an integer representing the sum of the number of the largest K paths that can be obtained)