STM32F4单脉冲控制

用C#开发屏幕截图的源代码,只有源码,不含工程文件(C# development screenshot of the source code, only the source code, project file does not contain)

千寻嵌入式SDK开发流程，及SDK包，FindM高精度定位(Chihiro Embedded SDK Development Process)

用PIC16F1933做的一个LCD显示时钟小程序(A LCD display clock applet made with PIC16F1933)

tsp问题中求解城市间距离最短的问题 环境C-tsp problem solving the shortest distance between cities in the problem environment, C++

排序算法，快速排序 ，归并排序，插入排序，选择排序，冒泡排序，递归和迭代的方法，

MSP430F149 例程，看门狗 C源程序代码。(MSP430F149 routine, the watchdog C source code.)

ats282x bluetooth dual mode

 通讯录使我们每个人必不可少的一个工具，此通讯录系统利用VC++设计完成。本着人性化的设计，此系统包括了联系人的姓名、电话、E-mail、和备注等信息，利用此系统可以对联系人进行查询、增加、修改、删除等操作，基本上可以满足我们对通讯录的需求。

这是一个C ++的测试程序里面包括好几个C++的小程序非常值得一看,无解压密码.-This is a C testing procedures including several inside the C is worth looking at very small programs without extracting passwords.

4-11 最优服务次序问« 问题描述：设有n 个顾客同时等待个顾客的服务次序才能使平总和除以n。« 编程任务：对于给定的n个顾客需要的服务时间，编程计算最优服务次序。« 数据输入：由文件input.txt给出输入数据。第一行是正整数n，表示有n 个顾客。接下来的1 行中，有n个正整数，表示n个顾客需要的服务时间。« 结果输出:将编程计算出的最小平均等待时间输出到文件output.txt。输入文件示例 输出文件示例input.txt output.txt1056 12 1 99 1000 234 33 55 99 812532.-4-11 optimal order asked laquo services; Problem description : n with customers while waiting for customer service so that the order can be divided by the sum of n-ping. Laquo; Programming tasks : to the n needs of its customers time and programming services for calculating optimal order. Laquo; Data input : from the document input.txt given input data. The first line is a positive integer n, n said a customer. Following a visit, n is an integer, n said the needs of the customer service hours. Laquo; Results output : Programming will calculate the average waiting time for the smallest output to a file output.txt. Examples of input document output files example input.txt output.txt1056 12 1 99 1000 23