登录
首页 » Windows开发 » c++ 完美演绎

c++ 完美演绎

于 2022-06-29 发布 文件大小:127.50 kB
0 194
下载积分: 2 下载次数: 1

代码说明:

c++ 完美演绎 -c++ perfect interpretation

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

发表评论

0 个回复

  • firewall software source code types : C source/Network Programming
    防火墙源代码 软件类型: C++源码 / 网络编程-firewall software source code types : C source/Network Programming
    2022-02-01 23:59:15下载
    积分:1
  • 磁盘文件的查找sam_sp_53
    磁盘文件的查找sam_sp_53-disk document search sam_sp_53
    2022-02-16 01:29:28下载
    积分:1
  • LSV2机床通信传输协议 const CString REQ_MAKEDIR = "C_DM" //创建目录 const CString REQ_D...
    LSV2机床通信传输协议 const CString REQ_MAKEDIR = "C_DM" //创建目录 const CString REQ_DELDIR = "C_DD" //删除目录 const CString REQ_DELFILE = "C_FD" //删除文件 const CString REQ_PROTECT = "C_FA" //保护文件 const CString REQ_RENAME = "C_FR" //重命名 const CString REQ_COPY = "C_FC" //拷贝 //-------------发送文件-------------- const CString REQ_SNDFILE = "R_FL" const CString REP_SNDFILE = "S_FL" //----------------------------------- //-------------接收文件-------------- const CString REQ_REVFILE = "C_FL" const CString REP_REVFILE = "S_FL" //----------------------------------- //-------------更改目录-------------- const CString REQ_CHGDIR = "C_DC" //更改目录 //-------------更改目录-------------- //-------------根目录名-------------- const CString ROOT_DIR_NAME = "LSV2" //根目录名 //-------------根目录名-LSV2 trans const CString REQ_MAKEDIR = "C_DM" //创建目录 const CString REQ_DELDIR = "C_DD" //删除目录 const CString REQ_DELFILE = "C_FD" //删除文件 const CString REQ_PROTECT = "
    2023-01-08 18:05:03下载
    积分:1
  • ITU标准目录,列出标准所有的目录,以备查找。
    ITU标准目录,列出标准所有的目录,以备查找。-ITU standard directory, listing all the standard directory for finding.
    2022-02-28 16:18:40下载
    积分:1
  • K r u s k a l算法每次选择n
    K r u s k a l算法每次选择n- 1条边,所使用的贪婪准则是:从剩下的 边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选 取的边若产生环路则不可能形成一棵生成树。K r u s k a l算法分e 步,其中e 是网络中 边的数目。按耗费递增的顺序来考虑这e 条边,每次考虑一条边。当考虑某条边时,若将其 加入到已选边的集合中会出现环路,则将其抛弃,否则,将它选入。-K ruskal algorithm for each choice of n-1 edges, the greed of the criteria used are: from the left edge select does not produce a loop with the smallest cost edge has been selected to join the edge of the collection. Taking note of the selected edges have a loop if it can not form a spanning tree. K ruskal algorithm sub-e-step, in which e is the number of network edge. According to the order of incremental cost to consider this e edges, each taking a side. When considering a certain edge when, if its added to a collection of selected edge loop will appear, will be its discarded, otherwise, it selected.
    2023-02-08 08:10:04下载
    积分:1
  • Short, but full
    短小,但功能齐备的邮件发送程序,界面良好-Short, but full-featured e-mail program, good interface
    2023-03-13 02:30:04下载
    积分:1
  • 基于对话框的计算器,实现了基本的加、减、乘除四则运算
    基于对话框的计算器,实现了基本的加、减、乘除四则运算-Calculator based on the dialog box to achieve the basic addition, subtraction, multiplication and division 4 computing
    2022-12-24 09:55:03下载
    积分:1
  • koch development of fractal problems
    koch development of fractal problems
    2022-07-22 07:14:46下载
    积分:1
  • 子类化程序,显示所有的消息
    子类化程序,显示所有的消息-Subclassing procedures, show all the news
    2022-03-12 08:54:27下载
    积分:1
  • java聊天室代码
    这是java8书上的一个经典例子,通过java创建出一个聊天室。
    2022-03-20 17:46:48下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载