这是一个简单易懂的crc计算方法，选择你要计算的文件，准确计算crc值。...

求解网络中的最短路径。假设某个计算机网络有n个站点，依次编号为1,2,…,n；有的站点之间有直接的线路连接（即这两个站点之间没有其它站点），有的站点之间没有直接的线路连接。如果用三元组（i,j,f）来表示该网络中的站点I和站点j之间有直接的线路连接且它们之间的距离为f 当已知该网络各站点之间的直接连接情况由m个三元组（i1,j1,f1）,(i2,j2,f2),…,(im,jm,fm)确定时，要求计算出对于网络中任意一个站点g(1≤g≤n)到其余各站点的最短距离。-the shortest path. Assuming a computer network n site, followed by No. 1, 2, ..., n; Some sites have direct connections (that is, between two sites are no other site), and some sites have no direct connections. If three yuan (i, j, f) to the network said the site j site and I have direct connections between them but the distance of f the network known as the site of the direct link between the situation by 3 m (i1, j1, f1), ( i2, j2, f2), ..., (im, jm, fm) to determine, calculate requirements for a network site arbitrary g (1 g n) of the rest of the site is the shortest distance.

----crear archivos.mdf.ldf和ndf

八 方块移动游戏要求从一个含8个数字（用1-8表示）的方块以及一个空格方块（用0表示）的3x3矩阵的起始状态开始，不断移动该空格方块以使其和相邻的方 块互换，直至达到所定义的目标状态。空格方块在中间位置时有上、下、左、右4个方向可移动，在四个角落上有2个方向可移动，在其他位置上有3个方向可移 动。例如，假设一个3x3矩阵的初始状态为： 8 0 3 2 1 4 7 6 5 目标状态为： 1 2 3 8 0 4 7 6 5-Eight-box requirements of mobile games from one containing eight numbers (1-8 with express) the box, as well as a space box (with 0) of the 3x3 matrix of the initial start, and constantly move the box to make space its adjacent box and swap until they reach their defined target state. Spaces in the middle position box has the upper and lower, left and right direction of four removable, in the four corners there are two directions can be mobile, in other locations has three movable direction. For example, suppose a 3x3 matrix of the initial state as follows: 803,214,765 target state as follows: 123,804,765

个人课程设计写的一个宿舍管理系统的全部源代码-Personal curriculum design management system written in a dormitory full source code

一个有关于VC++6.0与ACCESS数据库的小程序-1 on VC++6.0 and the ACCESS database, a small program

一个操作ＤＢＦ格式文件的类-an operation of the DBF format category

《数据结构与算法分析+C 2B 2B+描述+第三版》答案-answer

适合用来做K_Means 和K_NN的数据，一共150组，分成3个簇。-K_Means and make suitable for K_NN data, a total of 150 groups, divided into three clusters.

资源描述对于watataps酒店预订系统（Java GUI）提交：donbermoy星期三，2014年4月30日- 05:29语言：Java访问者访问了这11707次。这watataps酒店预订系统是我学生工作的计算机编程2防御，这个Java GUI编程题目最后的要求。本酒店预订系统是通过图形用户界面和数据库的访问2007。本系统特点：•客人信息•保留签入•校验付款房间•房间状态监测软件需要：JCreator 4.50，JDK 7，微软Access 2007帐户信息：用户名：管理密码：林顿在任何类型的编程语言，你的论文系统的更多的查询和需要程序员，只是联系我的号码如下。最好的问候，工程师。林顿bermoy它讲师/系统开发/安卓开发/自由程序员移动：09488225971座机：826-9296电子邮件：donbermoy@engineer.com