865736

image cropping ad asd

说明：  本压缩包里 有两个程序一个是vc++和arm的c语言在ads中开发。功能主要是串口发送命令个arm，然后arm响应命令，然后执行操作。对初学arm和vc的人很有帮助(The compression bag has two procedures one is vc++ And arm of the c language developed in the ads. Function is mainly to send the serial order of arm, and then arm in response to command, and then perform operations. Arm of the beginner and those who vc helpful)

为什么要上载这么多(why so many on the)

说明：  VC写的AVI文件解析及播放程序，使用VC解析avi文件主要是分析avi文件头，提取各种信息，比如采样率等，还可以计算文件播放时长。(The AVI file analysis and playback program written by VC. The analysis of AVI files using VC is mainly to analyze the AVI file header, extract various information, such as the sampling rate, etc., and also calculate the file playback time.)

一个简单的内存池实现算法，使用C++实现，使用VC6.0可以正常编译通过。(A simple memory pool algorithm, using C++ implementation by using VC6.0 to compile correctly.)

可以学习winfrom入门使用~~ qq 小demo(Getting started can learn winform ~~ qq small demo)

说明：  这个demo是一个twain协议实现的demo(This demo is a demo implemented by Twain protocol)

vc++利用mfc实现speech sdk(vc++ use mfc speech sdk)

可以變換cpu速度... 在dos下..若你的cpu 有speed變速功能可以使用這(work in cpu speed ... .. under the dos if you have the cpu speed transmission function can be used)

poj 3941 Hideyuki is allowed by his father Ujisato some 1000 yen bills every month for his pocket money. In the first day of every month, the number of bills is decided as follows. Ujisato prepares n pieces of m-sided dice and declares the cutback k. Hideyuki rolls these dice. The number of bills given is the sum of the spots of the rolled dice decreased by the cutback. Fortunately to Hideyuki, Ujisato promises him to give at least one bill, even if the sum of the spots does not exceed the cutback. Each of the dice has spots of 1 through m inclusive on each side, and the probability of each side is the same. In this problem, you are asked to write a program that finds the expected value of the number of given bills. (poj 3941 Hideyuki is allowed by his father Ujisato some 1000 yen bills every month for his pocket money. In the first day of every month, the number of bills is decided as follows. Ujisato prepares n pieces of m-sided dice and declares the cutback k. Hideyuki rolls these dice. The number of bills given is the sum of the spots of the rolled dice decreased by the cutback. Fortunately to Hideyuki, Ujisato promises him to give at least one bill, even if the sum of the spots does not exceed the cutback. Each of the dice has spots of 1 through m inclusive on each side, and the probability of each side is the same. In this problem, you are asked to write a program that finds the expected value of the number of given bills.)