登录
首页 » Visual C++ » wcd_Science

wcd_Science

于 2018-11-21 发布 文件大小:157KB
0 322
下载积分: 1 下载次数: 0

代码说明:

  The 1053 problem of online system ACM of Hangzhou University of Electronic Science and Technology, solved by greedy method

文件列表:

7tx1053.cpp, 2200 , 2009-02-15
z1Debug\tx1053.exe, 184382 , 2009-02-15
z1Debug\tx1053.obj, 4320 , 2009-02-15
Ptx1053.dsp, 4284 , 2009-02-15
tx1053.dsw, 537 , 2009-02-15
z1Debug\vc60.idb, 33792 , 2009-02-15
z1Debug\tx1053.ilk, 185712 , 2009-02-15
tx1053.ncb, 33792 , 2009-02-15
tx1053.opt, 48640 , 2009-02-15
z1Debug\tx1053.pch, 217516 , 2009-02-15
z1Debug\tx1053.pdb, 353280 , 2009-02-15
z1Debug\vc60.pdb, 45056 , 2009-02-15
tx1053.plg, 880 , 2009-02-15
z1Debug, 0 , 2018-11-08

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

发表评论

0 个回复

  • ahuangCD
    这个是数据结构课程设计中阿黄的CD的程序代码的工程文件包(This is a data structure curriculum design A yellow CD program code works package)
    2013-12-21 18:53:00下载
    积分:1
  • d
    有助于c++的初学者在平日的学习中更好的学习(Contribute to better learning c++ beginners learning on weekdays)
    2013-11-29 14:32:18下载
    积分:1
  • chess
    在N*N的棋盘上(1<=N<=10)填入1,2,...N*N共N*N个数,使得任意两个相邻的数之和为素数. (In the N* N chessboard (1 < = N < = 10) filled 1,2, ... N* N total number of N* N so that any two adjacent numbers and prime numbers.)
    2009-06-01 11:21:39下载
    积分:1
  • moni
    数据结构 银行模拟问题 (Bank of simulation data structure problem)
    2011-01-04 21:08:10下载
    积分:1
  • FRFT-algorim
    常在该网站下载资料,也想分享些材料上去,这个资料是FRFT算法(Often the site to download information, but also want to share some material up, this information is FRFT algorithm)
    2020-07-04 13:00:02下载
    积分:1
  • xunhuansaiqxf
    算法课程设计 分治法解决循环赛日程表 源代码+word报告+答辩PPT(Curriculum design of divide and conquer algorithm to solve a round robin schedule report+ source code+ word reply PPT)
    2010-05-26 23:51:17下载
    积分:1
  • ADOclass
    运用ADO封装类,可以直接实现数据库连接,增删查改的功能,简化代码,其中有详细说明书,函数等等说明(failed to translate)
    2009-12-31 00:07:39下载
    积分:1
  • fast_sort
    /*快速排序:以待排序元素中的第一个元素作为基准将带排序的元素分为三组 *大于基准元素为一组置于基准值的右边,小于基准值的元素为一组置于基准值的左边, *基准值为一组,这样就找到了基准元素的位置就确定了 *如此递归调用。直到每一组的low==high,即实现了排序的要求。 */ (/* Rapid Sort: the first element to be sorted in the element as a basis with with sorting the elements are divided into three groups* is greater than the reference element of a group is placed on the right side of the reference value, smaller than the reference value elements for a group of placed on the left side of the reference value,* reference value, a group, so that the location of the reference element is found it is determined* so recursive call. Until each group of low == high to achieve the requirements of the sort.* /)
    2012-10-26 21:42:43下载
    积分:1
  • LongestIncreasingSequence
    找出数组A中最长的递增序列的长度,使用动态规划算法,复杂度为O(N*N)。(Find the longest increasing sequence)
    2011-09-05 17:36:27下载
    积分:1
  • AOV-Sort-Algorithm
    使用C语言编写的AOV网的拓扑排序,内附有详细的源码解释和输入示意图(Using C language AOV network topological sorting, enclosing a detailed explanation and input source diagram)
    2011-10-26 16:34:29下载
    积分:1
  • 696516资源总数
  • 106442会员总数
  • 11今日下载