[书籍源码] ourdev_549748
国际上通用的* 种热电偶，即#，8，9，5，:，6， 及
" 型号的热电偶，按!"# $ & 要求，中国计量科学院凌
善康等人应用美国标准与技术研究所（:!#"）和美国试
验与材料学会（<#".）给出的有关公式和系数，进行了
计算并编制了分度表，于’ 7 年出版。因此，使用这些
公式进行编程计算，打印计算结果并与分度表比较，使
程序的编制和对程序正确性的验证有了充分的依据
Internationally accepted* thermocouple, that#, 8,9,5,:, 6 and " type thermocouple, according to!" # $ & Requirements, China Institute of Metrology Lingshan Kang, who applied the United States (:!#" ) Institute of Standards and Technology and the American Society for Testing and Materials (< #" .) given the formula and coefficients were calculated and the preparation of the indexing table in ' 7 was published. Therefore, the program calculated using these formulas, print results and comparison with the indexing table, the program' s preparation and verification of the correctness of the program have a sufficient basis for (2011-07-02, Visual C++, 95KB, 下载13次)
[书籍源码] helllo
hello world 基础应用
才语言最常用的基本应用，适合初学者，测试娱乐
hello world (2010-05-24, Visual C++, 1KB, 下载83次)
[书籍源码] baoan
1.问题描述
世界名画陈列馆有m*n个陈列室组成。为了防止名画被盗，需要在陈列室设置警卫机器人哨位，每算法个警卫机器人除了监视它所在的陈列室之外，还可以监视与它所在的陈列室相邻的上，下，左，右4个陈列室。
2.要求
试要求，设计一个安排警卫机器人哨位的算法，使得名画陈列馆的每个陈列室都在警卫机器人监视之下，切所用的警卫机器人数目最少。
1. Description of the problem: world-famous paintings m* n rows of buildings are composed of a showroom. In order to prevent the paintings stolen, you need to set the security robot sentinel showroom, each algorithm is a security robot in addition to monitor it in the showroom, you can also watch it in the showroom with the adjacent upper and lower, left, Right 4 showrooms.
2. Requested test requirements, design an arrangement guard robot sentinel algorithm, making paintings in each gallery showroom are under the surveillance of the security robot, cutting the number of robots used by security guards at least.
(2010-01-09, Visual C++, 37KB, 下载66次)
[书籍源码] C
含有一个文本文件和五个目录。
BOOK1 目录：包含《科学计算和C程序集》一书的所有程序。BOOK1B 提供
BOOK1的一个备份。
BOOK2目录：包含《实用计算机绘图》一书的所有程序。该书已由本社出版，
作者为蒋长锦、蒋智。
Contains a text file and five directories. BOOK1 directory: contains the " scientific computing and C assembly," a book of all programs. BOOK1B provide BOOK1 a backup. BOOK2 directory: contains " practical computer graphics," a book of all programs. The book published by Xinhua, author JIANG Chang-Jin, JIANG Zhi. (2009-11-05, Visual C++, 318KB, 下载7次)
[书籍源码] tanchishe
贪吃蛇小游戏，新手都能玩，希望大家喜欢。本人初学C++
Snake game (2009-06-11, Visual C++, 2KB, 下载4次)
[书籍源码] ehTETQ8h
自己照TTCP写的一个测试网络的程序 还不完善 不过这个功能是可以实现的
里面是源代码+说明+程序 感兴趣的朋友可以试下 也希望给我提出建议
说明：
类似于ping命令的的发包程序 需要两台电脑 因为是用UDP做的 不是ICMP
格式：
xyz -p -n 100 -w 100 -l 1000 192.168.1.1
-p 代表ping 还有其他功能的 不过目前都没做
-n 代表发包个数
-l 代表包的大小是多少字节
简单的格式就是
xyz -p 192.168.1.1 其他参数是可以随便加的
需要两台电脑
一台发 一台收
另一台写 xyz -r 就可以了
A simple tool for sending packet (2009-06-07, Visual C++, 41KB, 下载33次)
[书籍源码] CRC
CRC校验码生成软件，试用于调试通信时做数据校验时使用，一个不错的软件
CRC Check Code generation software, the trial in the debug communication data when checking the use of, a good software (2008-10-25, Visual C++, 126KB, 下载137次)
[书籍源码] zhongweishu.cpp
X[0:n-1]和Y[0:n-1]为2个数组,每个数组中含有n个已排好序的数。
试设计一个O(log n)时间的算法,找出X和Y的2n个数的中位数。
X [0: n-1] and Y [0: n-1] for the two arrays, each array contains n have lined up a number sequence. Try to design a O (log n) time algorithm to find X and Y number of 2n median. (2008-08-31, Visual C++, 1KB, 下载24次)
[书籍源码] 321
一个局域网的斗地主游戏，可以让几个人一起玩的
A LAN斗地主games, few people can play together (2008-08-14, Visual C++, 6201KB, 下载18次)
[书籍源码] medi
设X[0:n-1]和Y[0:n-1] 为2 个数组,每个数组中含有n 个已排好序的数。试设计一个O(log n) 时间的算法,找出X 和Y 的2n 个数的中位数。
Set X [0: n-1] and Y [0: n-1] for the two arrays, each array contains n have lined up a number sequence. Try to design a O (log n) time algorithm to find X and Y number of 2n median. (2008-07-07, Visual C++, 1KB, 下载22次)
[书籍源码] ch3.16
Ch03 Ex16
[Ch03 Ex16] 假设如题3.1所述火车调度站的入口处有n节硬席或软席车厢（分别以H和S表示）
等待调度，试编写算法，输出对这n节车厢进行调度的操作（即入栈或出栈操作）序列，以使用
所有的软席车厢都被调整到硬席车厢之前。
串。
Ch03 Ex16 [Ch03 Ex16] assumptions, such as described in 3.1 title at the entrance to the train station scheduling has n hard seat section or Green compartment (H and S, respectively, to express) to wait for scheduling, preparation of test algorithm, the output of these n cars for scheduling operation (that is, a stack operation or?) sequence, to use all of the Green compartments were adjusted to the hard seat compartment before. String. (2008-05-12, Visual C++, 1KB, 下载5次)