C achieve similar to the Windows Calculator function of a more perfect calculato...

wince 6.0下SMSC9118 100M网卡驱动，基于PXA270测试通过，并且支持10M/100M自适应功能,并且能够自适应交叉线和直连线-wince 6.0 network card driver under SMSC9118 100M, based on the PXA270 test and support 10M/100M adaptive function, and can self-adaptive crossover and straight-line connection

窗口置顶功能，防止其他窗口挡住指定窗口，使其能一直显示在最前端-Top features a window to prevent other windows to block the designated window, so that they can always show in the most front-end

matlab fft 加速度时程与位移的变换-fourier

一些Vc++的小程序，有些比较精辟的编程，值得初学者学习。-Some Vc++ Small procedures, and some brilliant programming comparison, it is worth learning for beginners.

任务：参加运动会有n个学校，学校编号为1……n。比赛分成m个男子项目，和w个女子项目。项目编号为男子1……m，女子m+1……m+w。不同的项目取前五名或前三名积分；取前五名的积分分别为：7、5、3、2、1，前三名的积分分别为：5、3、2；哪些取前五名或前三名由学生自己设定。（m=10 , w=8 , n=15） 功能要求： 1). 可以输入各个项目的前三名或前五名的成绩； 2)．能统计各学校总分（用链表）； 3)．可以按学校编号、学校总分、男女团体总分排序输出（快速、基数）； 4). 可按学校编号查询学校某个项目的情况；可按项目编号查询取得前三或前五名的学校。 界面要求：有合理的提示，每个功能可以设立菜单，根据提示，可以完成相关的功能要求。 b)概要设计： 本程序所使用的数据结构是二维数祖和线形链表。 所使用的算法有：快速、基数、归并排序等。-mission : participation in the Games is n, the school No. 1 ... n. Competition is divided into men m, and w-woman project. Item No. 1 man ... m, a woman m m w .... Different items from the top five or top three integration; From the top five points were : 7,5,3,2,1, and the top three points were : red; From what the top five or top three, set by the students themselves. (M = 10, w = 8, n = 15) functional requirements : 1). The importation of various items in the top three or top five results; 2). Statistics schools score (with Chain); 3). According No. schools, the school scores and scores of men a

WINDOWS系统核心编程，对初学者很有帮助!-WINDOWS system kernel programming, very helpful for beginners!

很好的webshell 刚刚劫到的 和大家分享一下-Good webshell just robbed and the U.S. share

VC++ 6.0一些基础控件使用的例子!Good luck!谢谢~-VC++ 6.0 controls the use of some basic examples! Good luck! Thank you ~

一个比较好和干净的process killer VC++ 例子-A relatively good and clean process killer VC++ Example

java 编写的背包问题，按不同的方法选择不错啊-prepared by the knapsack problem by different methods to choose good ah