使用USB图像采集

访问图片的源代码-visit the source code

可调时钟 实验要求：1.能正常显示一天24小时时间 2.具有清零、各位均可调功能 3.按钮设置防抖 4.可调不能通过将该位置零，然后用计数器连续加1的方法实现，并且实现每一位都单独可调 -Adjustable clock Experimental requirements: 1. To show the normal 24 hours a day 2. Has cleared, you can transfer function 3. Button to set up Anti-Shake 4. Adjustable position can not be zero, and then use the counter of one continuous method, and realize every single adjustable

License Options file and may replace Named Users for a Program, whether temporarily or not, no more than four (4) times per year, prov file never exceeds the number licensed per Program. Portions of the Programs may be installed on individual computers to accelerate startup times, as long as the-License Options file and may replace Named Users for a Program. whether temporarily or not. no more than four (4) times per year. 577 file never exceeds the number licensed per Program. Portions of the Programs may be instal led on individual computers to accelerate star tup times, as long as the

A remake of the classic game of Space Invaders is included. This game is used to explore a number of issues surrounding game design and implementation.

安装一个鼠标钩子-install a mouse hook

网络结构图控件中的节点定义,可用于配置分布式系统网络结构-network structure of the control node definition can be used to configure distributed network structure

本代码是关于windows网络程序设计的，书籍的源码，很全面。可以参考一下。-The code is on the windows network programming, the source book, very comprehensive. For reference.

c的小程序很有用的，我认为很好的，也蛮经典的！希望对大家有帮助！-c small procedures very useful, I think very good, but also pretty classic! We want to help!

动态规划----矩阵连乘问题 动态规划法是解决问题的一种方法。它不规定为了得到结果需如何将问题划分为子问题的固定方法，而是按不同输入给出问题的具体实例的子问题划分方法，然后再进行运算、解答问题。 矩阵连乘问题的主要思想如下： 1）设置大小为连乘个数的方阵 2）主对角线上方各元素Di,j(ij)记录获得该最小工作量矩阵分组的第一组的最后一个矩阵的序列号 最后通过下方元素可知最终结果的分组方式。-dynamic programming matrix continually multiply-dynamic programming problem is a problem-solving method. It does not require the results need to be how to divide the problems of the sub- problems fixed, but different input given by the specific example of the problem partition method, and then calculate, and answer questions. Matrix continually multiply the main idea is as follows : 1) the installation of the size of continually multiply the number phalanx 2) above the main diagonal elements Di, j (ilt; J) Matrix Mi continually multiply to the smallest workload 3) below elements Di, j (IGT; J) the record was the smallest workload of a matrix of the first group of a matrix of the final sequence, followed by the final element of the final results of the

能自动实行买卖西瓜,能够检验是否已经卖完西瓜-can automatically implement the sale of watermelon, to test whether the watermelon has sold off