登录
首页 » DOS » SkypeSetup

SkypeSetup

于 2018-06-06 发布 文件大小:1330KB
0 236
下载积分: 1 下载次数: 0

代码说明:

  file to cmd dos windows to play others

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

发表评论

0 个回复

  • ppt_d5005c738e83ad6fddcdc6b285810a94
    说明:  PPT for business office, it has simple style, suitable for many occasions.
    2020-06-25 15:20:02下载
    积分:1
  • 1 c# developer of enterprise management applications, interface, beautiful, full
    一个c#开发的企业管理应用,界面漂亮,功能全面,很值得一看!-1 c# developer of enterprise management applications, interface, beautiful, full-featured, it is worth a visit!
    2022-04-09 00:22:35下载
    积分:1
  • 11-TFT彩色屏
    说明:  基于stm32l476的显示屏例程,接口为SPI,使用最新的HAL库,有cubemx工程文件可供参阅(Based on the display routine of stm32l476, the interface is SPI, using the latest HAL library, there are cubemx engineering files available for reference)
    2020-06-20 11:00:02下载
    积分:1
  • 一个很实用的DNS域名解析DNS,用于网络视频服务器中。
    一个很实用的DNS域名解析DNS,用于网络视频服务器中。-A very useful DNS DNS DNS, for network video server.
    2022-03-23 23:35:49下载
    积分:1
  • 是一个用vc编的绘制多彩立方体的小程序,看看吧,很有意思的...
    是一个用vc编的绘制多彩立方体的小程序,看看吧,很有意思的-with vc is a series of the mapping of small colorful cube procedures, and let"s see it, it"s fun
    2022-03-25 04:25:33下载
    积分:1
  • Delphi书籍
    说明:  压缩包里面是一些 delphi 书籍,可以下载看看(Some book for delphi,you can download see it .)
    2020-04-21 10:59:09下载
    积分:1
  • fiberSPR
    光纤SPR共振峰理论分析,可以改变不同的光纤参数得到共振峰信息(fiber SPR peak)
    2021-04-28 08:58:44下载
    积分:1
  • 平衡二叉树操作的演示 一、 需求分析 (1) 利用平衡二叉树实现动态查找表。实现查找,插入和删除三种基本功能。 (2) 初始,平衡二叉树为空树,操作...
    平衡二叉树操作的演示 一、 需求分析 (1) 利用平衡二叉树实现动态查找表。实现查找,插入和删除三种基本功能。 (2) 初始,平衡二叉树为空树,操作界面给出查找,插入和删除三种操供选择。每种操作均要提示输入关键字。每次插入和删除一个接点时,显示更新的平衡二叉树。 (3) 重点在于对删除算法的实现。假设要删除的关键字为X的结点,若X不在叶子结点上,则用左子树中的最大值或者右子树中的最小值取代X。如此反复,直到删除动作传递到某个叶子结点,删除叶子结点时,若要进行平衡变换,可采用插入的平衡变换反变换。 -balanced binary tree operation of a demonstration, demand analysis (1) using a balanced binary tree dynamic lookup table. Lookup, insertion and deletion of the three basic functions. (2) The initial, balanced binary tree is empty tree interface gives you insert and delete options for the three parade. Each operation will have to be me to input keywords. Each insert and delete a contact in that update balanced binary tree. (3), the focus is on the deletion algorithm. To remove the assumption that the keyword for the X-Node, if X is not the leaf nodes, Left-used for the highest tree or right-tree to replace the minimum X. So repeatedly, until the deletion of a transfer leaf nodes, delete the leaf nodes, if balancing transform, Ins
    2022-03-05 06:54:53下载
    积分:1
  • Description You should upload You should upload program
    说明:  Description You should upload You should upload
    2020-06-24 00:00:08下载
    积分:1
  • 123456
    说明:  uhard subroutine code in fortran for abaqus
    2020-12-14 17:43:33下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载