Visual C++ 6.0项目开发指南

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

编程H264学习编程AVI;H264流文件转换为AVI文件。

仿制金山毒霸专杀工具界面-imitation hand over regularly planned monthly updates interface

用泰勒方法 和 李查逊加速外推法 实现1-100之间的ln(x)计算。其中加减乘除由自己编程实现，因此不受计算机数值变量存储位数的影响。计算精度可以自己规定。几十位左右的精度时可保持计算稳定。

涡流检测仪录制的数据在windows xp上的图像回放-Eddy current detector data recorded in the windows xp image playback

该程序用贪心算法来求解最小生成树问题 采用贪婪准则：每次选择边权值最小边。如果该边加入后不构成环，则加入。-procedures with the greedy algorithm to solve the problem using the minimum spanning tree greedy guidelines : each side the right to choose the minimum value side. If the edge after the entry does not constitute a part, while accession.

易语言 调用sys驱动的例程 用于给初学者 学习 使用 -E language Use sys

一个很好玩的扫雷游戏-a very fun game demining

粒子群优化算法（PSO）应用于神经网络优化程序-Particle Swarm Optimization (PSO) algorithm used neural network optimization procedures

这是尼日利亚的美国大学2009临床的软件工程类项目的工资计算程序。要到工资记录的所有员工，点击“[选择任务]”下拉列表中，选择“工资记录”。的工资记录窗口将打开。您还可以得到一个特定的员工的就业通过点击来自雇员窗口中的“查看工资单”的链接。在数据窗口，选择一个员工从下拉列表的员工。要查看特定的年和月工资记录，从下面的列表中选定的员工所需的月份和年份，单击。 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报