-
使用Winsock实现网络聊天室的功能,用visual c++编写。
使用Winsock实现网络聊天室的功能,用visual c++编写。-The use of Winsock realize the function of the network chat rooms, using visual c++ Prepared.
- 2022-10-25 14:15:03下载
- 积分:1
-
Fourier
《实用Fourier变换及C++实现》随书光盘源码,提供了Fourier变换、Hillbert变换等模板库(" Practical Fourier Transform and C++ to achieve," the book s CD-ROM code, provides Fourier transforms, Hillbert transform template library, etc.)
- 2009-10-09 14:45:26下载
- 积分:1
-
聊天室liu luululi ullui lu iyuyku
聊天室liu luululi ullui lu iyuyku-Chat liu luululi ullui lu iyuyku
- 2022-01-28 15:01:16下载
- 积分:1
-
RDADCP_dec05v0
方便好用的声学多普勒海流剖面仪(ADCP)海流数据Matlab处理程序。程序文件头信息有详细的使用说明。( ADCP=RDRADCP(NAME) reads the raw binary RDI BB/Workhorse ADCP file NAME and
puts all the relevant configuration and measured data into a data structure
ADCP (which is self-explanatory). This program is designed for handling data
recorded by moored instruments (primarily Workhorse-type but can also read
Broadband) and then downloaded post-deployment.)
- 2021-05-07 03:28:37下载
- 积分:1
-
- 2022-08-10 17:18:30下载
- 积分:1
-
HLA 仿真实例 DOMS RTI
HLA 仿真实例 DOMS RTI-1.3-HLA simulation DOMS RTI-1.3
- 2023-03-03 15:25:04下载
- 积分:1
-
castle
*what is this? a small castle adventure room(ran-file) viewer
*controls? w for next room, s for previous room q or ESC for exit
v toggles between view and walk mode use w , a , s , d in walk mode
*i can t see the hole room? resize your window (25-30 needed)
*what is castleD.exe? the debug build
*build system? visualc 6(sp5), winxp(sp1)
*how to build? load the castle.dsw in your visualc6 (or above) and press F9(run) or F5(debug)
*other questions? no? - thx
Source code features:
*no design
*no oop
*no portability
*globals
*no nameing convention
*defines
*bad names
*a good "do not" example
- 2013-04-15 21:47:07下载
- 积分:1
-
Thumbnail_demo
应用程序中使用Thumbnail(applications using Thumbnail)
- 2004-10-05 11:22:49下载
- 积分:1
-
关于局域网的点对点的对话
关于局域网的点对点的对话-on point-to-point LAN dialogue
- 2022-10-13 20:55:03下载
- 积分:1
-
钻石矿工
算法设计中的钻石矿工问题在一座金字塔每块石头上都镶有一块钻石从金字塔的顶端向下收集钻石尽可能收集价值高的钻石,每层每次只能从一块砖斜向左下或斜向右下走到另一块砖上。设计算法求出获取的钻石最大价值及路径。(动态规划)(The problem of diamond miner in algorithm design is set up on every stone in Pyramid. A diamond is collected from the top of Pyramid. Diamond is collected as high as possible. Every layer can only lean from one brick to the left or to the right to go to the next brick at a time. The design algorithm is used to find the maximum value and path of the obtained diamond. (dynamic programming))
- 2020-10-21 08:37:24下载
- 积分:1