winpcap learning the code,. net2005c++, first install the winpcap driver, and wi...

意法半导体的，TM32F429的T9拼音输入法,带LCD触摸屏，经过测试完美，可用的。

opengl初始化后，建立单文档前运行的程序

很小很经典的一个游戏——取石子，一次只允许取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.)

图像拾取演示，精选ios编程学习源码，很好的参考资料。(Image pickup demonstration, selection of learning IOS programming source code, a good reference.)

EM8471神龙卡源代码,支持MPEG4,AVI等硬件格式播放.(EM8471 SHENLONG card source code, support for MPEG4, AVI format players and other hardware.)

气泡上浮实验，基于fluent的二维模型(Bubble Floating Experiment)

说明：  瓦岗寨攻略书 是游戏瓦岗债的攻略书 内容齐全(GONG LUE SHU )

鉴于stm32在keil平台上的SPI通信实验(spi communications experiment)

c#代码，简易计算器，不完整，上课做的。大家多多指教-c# code, simple calculator, incomplete in class to do so. All the exhibitions

我们的目的是将一个分数拆分成若干个分子是1分母是正整数的分数之和的形式。例如2/3可以拆分成1/2+1/6的形式。这里不考虑顺序，比如1/6+1/2和1/2+1/6相同。 输入p, q, a, n, 其中p/q为分数，对这个分数进行拆分，要求拆分的分数个数不能多于n个，所有分母的乘积不能大于a。求有多少种拆分方法? 输入：最多200组数据。在每行中都有四个数分别表示p, q, a, n，之间以空格隔开，并且满足p,q<=800，a<=12000，n<=7，最后以四个0做为输入的结束。 输入示例: 2 3 120 3 2 3 300 3 0 0 0 0 输出示例: 4 7 (Our aim is to split a fraction into a number of elements is a denominator is a positive integer fraction of the sum of form. For example, 2/3 can be split into 1/2+1/6 form. Not considered here, the order, such as 1/6+1/2 and 1/2+1/6 of the same. Input p, q, a, n, where p/q as a fraction of this split scores require no more than the number of split points n-all the product of the denominator can not be larger than a. How many kinds of demand split method? Input: Up to 200 sets of data. In each line has four numbers indicate the p, q, a, n, separated by a space between, and meet the p, q < = 800, a < = 12000, n < = 7, the end, four 0 as the input end. Input Example: 2,312,032,330,030,000 sample output: 47)