登录
首页 » Visual C++ » zhajinhua

zhajinhua

于 2014-02-10 发布 文件大小:9685KB
0 223
下载积分: 1 下载次数: 21

代码说明:

  6603二次开发运营版炸金花,带前后台控制(6603 Golden fried version of the secondary development operations)

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

发表评论

0 个回复

  • kjsjsy
    说明:  空间数据索引技术的描述,初学者可以进行简单的了解(Description of spatial data indexing technology, beginners can be a simple understanding of)
    2010-03-22 23:49:38下载
    积分:1
  • vc_matlab
    Visual C++_MATLAB图像处理与识别实用案例精选+源代码(Visual C++ _MATLAB image processing and recognition of practical case selection+ Source Code)
    2009-12-18 10:14:53下载
    积分:1
  • planetrendering
    planet rendering program implementation
    2014-01-23 03:40:25下载
    积分:1
  • VBdiaoyongMATLAB
    说明:  VB调用MATLAB 使用VB来调用matlab里的函数,可以综合matlab的强大功能使vb开发的程序效率更高。(MATLAB using VB to call matlab in VB to call the function, can be integrated so that the power of matlab programs vb efficient.)
    2009-08-02 17:12:37下载
    积分:1
  • Trigger
    说明:  数字电子技术基本元件--触发器 的程序, 支持多种触发器图形显示.(Trigger)
    2010-03-30 11:13:40下载
    积分:1
  • a
    说明:  算法实验指导书算法实验指导书算法实验指导书算法实验指导书(Experimental test algorithm instructions guide book algorithm algorithm algorithm for experimental experimental instructions guide book)
    2009-11-09 14:36:59下载
    积分:1
  • 02
    说明:  一些有关最优控制理论的控制实例程序集和仿真 (Control instance assembly of the optimal control theory and simulation)
    2012-06-11 16:31:22下载
    积分:1
  • qrcode
    加行高斯白噪声下的低密度奇偶校验码的算法,简单的程序,对初学者有用。(Add the line under the Gaussian white noise low-density parity-check codes of the algorithm, a simple procedure, useful for beginners.)
    2010-11-17 17:57:02下载
    积分:1
  • shannocode
    用C语言或者Matlab编写香农编码的程序(Written with C language or Matlab coding procedures Shannon)
    2010-05-28 22:06:08下载
    积分:1
  • 0
    说明:  给定n种物品和一个背包,物品i的重量是Wi,价值是vi,被包容量是C,应该如何选择装入被包的物品,使得装入背包中物品的总价值最大?对于每种物品i,只有两种选择,装入或者不装入. 输入:第一行两个正整数n(物品数)和C(容量) 第二行n个正整数n,表示物品价值 第三行n个正整数n,表示物品重量 输出:第一行表示总价值 第二行n个数(0/1),0表示物品不装入,1表示装入 例如, 输入: 5 10 6 3 5 4 6 2 2 6 5 4 输出 15 1 1 0 0 1 (Species of a given n items and a backpack, the weight of item i is Wi, the value of vi, was packet capacity is C, should be how to choose a package of items to be loaded, the backpack load in the largest total value of goods? For each item i, there are only two options, loaded or not loaded. Input: the first line of the two positive integer n (the number of items) and C (capacity) of the second line of n positive integer n, that the value of the third line of n positive integer n, that the weight of output: the total value of the first line of the second line, said n number of (0/1), 0 that the items do not load, that load 1 for example, enter: 5,106,354,622 6 5 4 output 15 1 1 0 0 1)
    2009-07-01 23:07:01下载
    积分:1
  • 696516资源总数
  • 106554会员总数
  • 12今日下载