登录
首页 » Visual C++ » fucker

fucker

于 2010-04-25 发布 文件大小:290KB
0 169
下载积分: 1 下载次数: 3

代码说明:

  һ

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • host2
    说明:  马踏棋盘算法编程,实现在棋盘上任意两点间的最短路径求解。(horse riding chessboard programming algorithm to achieve on the chessboard arbitrary 2:00 of finding the shortest path.)
    2006-04-30 00:12:21下载
    积分:1
  • 程序设计课程设计综合设计2二简章的计算器
    简单编程给需要的人,VC做的计算器。还有说明(simple programming to the people in need, VC done calculator. Also note)
    2005-08-18 13:34:18下载
    积分:1
  • ds1104_vect_serial
    DS 1014 IMFOC control
    2012-05-16 04:20:45下载
    积分:1
  • SMM
    说明:  几种模幂算法,有传统模幂,SMM模幂,基于2的K次方的模幂和最一般的模幂算法,还有为这些模幂算法建立的WINDOWS对话框。可以方便的运行。(algorithm, the traditional mode power, SMM Modular Power, Based on two of the K-th power module and the most common mode power algorithm, These modules also for the establishment of the algorithm Power Windows dialog box. To facilitate the operation.)
    2006-04-27 22:49:38下载
    积分:1
  • dianjx
    电极系测井曲线 用matlab编写的用于学测井同学用(Electrode system logs using matlab for students with learning logs)
    2013-11-29 14:26:39下载
    积分:1
  • OpenGL开发的机械臂运动仿真程序(含代码)
    OpenGL开发的机械臂运动仿真程序,可以运行,可以借鉴(OpenGL development of the manipulator motion simulation program, can run, can learn from)
    2017-12-22 11:09:16下载
    积分:1
  • MemoryFile
    这是一本关于Windows下内存映射文件相关内容的书籍, 通过它可以操作文件,它的速度是I/O操作的20倍,及其适合大文件的操作(This is a book about Windows memory mapping document of relevant books, through which it can file, its speed is I/O operation20 times, and is suitable for large files )
    2012-06-14 15:59:44下载
    积分:1
  • RC4
    对RC4加密解密代码,可以自行修改密钥!类可以直接调用(RC4 encryption and decryption code, you can modify the key! Class can be called directly)
    2020-10-13 23:17:31下载
    积分:1
  • sa+ga
    采用遗传算法和模拟退火算法解决VLSI中的布局优化问题()
    2020-12-23 20:09:06下载
    积分:1
  • Graph
    输入一个带权无向图的顶点数、边数、各条边信息(两个顶点和权值),建立该图的邻接矩阵结构,输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构,输出该邻接表;根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列,并输出遍历结果;用prim算法实现构造该带权无向图的最小生成树,并将该最小生成树的各条边信息输出。(Enter a weighted undirected graph with vertices, edges, each of the side information (two vertices and weights), the establishment of the adjacency matrix structure, the output of the adjacency matrix. The above undirected graph adjacency matrix into adjacency list structure, the output of the adjacency list according to the adjacency table undirected graph depth-first traversal sequence and breadth-first traversal sequence, and outputs through the results using prim algorithm construct the weighted undirected graph minimum spanning tree, and the minimum spanning tree information on respective sides of the output.)
    2020-12-13 15:29:15下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载