在国际VC实现Windows编程环境的使用…

网络蚂蚁功能模拟 将不同数据包的信息整合-Functional simulation NetAnts different packets of information integration

Assume that Edison has found himself in a square-shaped maze of NxN square cells which is surrounded by walls from the outside. In the maze, some of the cells are also walls. Edison can only move between two empty cells in four directions, north, south, west and east. In order to get out of the maze, he drafts a plan. He uses his left hand to lean on the wall and goes by following the wall. Here is the question, is Edison able to get out of the maze in at most 10,000 steps? If he can make it, output the path. By getting out of the maze, he only needs to be in the exit cell. If the starting cell is the same as the exit, Edison won"t need to move and can directly get out of the maze. Input The first line of the input gives the number of test cases, T. T test cases follow. Each test case starts with an integer N. N is the size of the maze. Th

edit control

C++编写的日历程序，比较简单，可以在一些小的应用中借鉴。

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

基于IDL和VisualC_的混合编程，详述了IDL语言，并实例演示两者的调用-Based on IDL and VisualC_ mix of programming, detailing the IDL language, and examples of presentation between the two calls

Problem A:编辑距离问题 Time Limit:1000MS Memory Limit:65536K Total Submit:157 Accepted:79 Description 设A 和B 是2 个字符串。要用最少的字符操作将字符串A 转换为字符串B。这里所说的字符操作包括 (1)删除一个字符； (2)插入一个字符； (3)将一个字符改为另一个字符。 将字符串A变换为字符串B 所用的最少字符操作数称为字符串A到B 的编辑距离，记为d(A,B)。试设计一个有效算法，对任给的2 个字符串A和B，计算出它们的编辑距离d(A,B)。 编程任务： 对于给定的字符串A和字符串B，编程计算其编辑距离d(A,B)。 Input 输入由多组测试数据组成。 每组测试数据输入的第1 行是字符串A，第2行是字符串B。 Output 对应每组输入，输出的每行中的数是编辑距离d(A,B)。 Sample Input fxpimu xwrs Sample Output 5-Problem A:

CAsyncSocket Sample client/server

01.C-#语法篇(上).rar 01.C-#语法篇(上).rar-C# language

AHK Windows 鼠标手势演示 用autohotkey编写的在windows下面使用的鼠标手势 功能类似maxhton中的鼠标手势，目标为窗口-AHK_Windows_MouseGestures_Demo