求两个序列的相关关系的fortan程序

excell的实用，数据导入 生成 方便实用 好东西-excell practical, convenient and practical data into generating a good thing

VC数据库编程,把图片放到数据库种,初学的,有点用处-VC database programming, the picture on the database species, beginner, and a bit useless

delanay 三角形 生成的程序，还有相关资料的-delanay s

MGL(S)-10032A 100x32 Graphical LCD header file driver

一个ada的编译器-a compiler

精饲料单放机快速地翻看联赛积 v-Feed player quickly look at the plot League player feed quickly look at the league plot v

陈列馆问题： 1.问题描述 世界名画陈列馆有m*n个陈列室组成。为了防止名画被盗，需要在陈列室设置警卫机器人哨位，每算法个警卫机器人除了监视它所在的陈列室之外，还可以监视与它所在的陈列室相邻的上，下，左，右4个陈列室。 2.要求 试要求，设计一个安排警卫机器人哨位的算法，使得名画陈列馆的每个陈列室都在警卫机器人监视之下，切所用的警卫机器人数目最少。 3.结果输出 将计算的警卫机器人数及其最佳哨位安排输出到文件output.txt。文件的第1行是警卫机器人数；接下来的m行中每行n个数，0表示无哨位，1表示哨位。-Gallery problem: 1. Problem Description Painting gallery in the world there are m* n 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. Demand 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. 3. The resulting output Will calculate the number of security robots and the best sentinel ar

msp 温控的代码，精度不太高。但是，比较简易的代码。-msp temperature control of the code, not too high accuracy. However, the relatively simple code.

使自己成为一个小汉字字体程序自己变成小字体小字体程序自己变成中文程序

通用二叉搜索树，包含的算法有：输出广度优先遍历、前序、中序、后序遍历结果，按树的形状打印树，统计总节点数，统计叶子节点数，统计右节点数，计算树的高度，删除所有叶子节点，插入节点，查找节点，删除节点，由前序遍历结果和中序遍历结果生成树，由后序遍历结果和中序遍历结果生成树，检查该树是否平衡和完全平衡。-generic binary search tree contains the algorithm are : output breadth- first traversal, the former sequence, sequence, after the preorder, the shape of the tree by tree print, the total number of nodes statistics, statistics leaf nodes, the nodes to the right statistics to calculate tree height, remove all leaf nodes, insert nodes, the nodes you delete nodes from the former preorder results and the results of Spanning Tree preorder, After the preorder from the results and the results preorder spanning tree, check whether the tree balanced and complete balance.