oracle9i错误号查询

假设以如下说明的三元组 (F、C、L/R) 序列输入一棵二叉树的诸边(其中 F 表示双亲结点的标识，C 表示孩子结点标识，L/R 表示 C 为 F 的左孩子或右孩子)，且在输入的三元组序列中，C 是按层次顺序出现的。设结点的标识是字符类型。F=‘＾’时 C 为根结点标识，若 C 亦为‘＾’，则表示输入结束。试编写算法，由输入的三元组序列建立二叉树的二叉链表,并以中序序列输出。^AL ABL ACR BDL CEL CFR DGR FHL ^^L -Assuming the following description of the triple (F, C, L/R) sequence of a binary tree of all the input side (where F that identifies the parent node, C, said child node ID, L/R that C is F, left or right child child), and triples in the input sequence, C is the emergence of a hierarchical order. Node identity is established character types. F = " ^" C for the root identity when, if C is also a " ^" , then enter the end. Test preparation algorithm, the input sequence of triples binary build the binary tree list, and in order to sequence the output

英语学习的软件说明-English learning software Note

磁盘文件最优存储问题，设磁盘上有n 个文件f1, f1,fn，每个文件占磁盘上1 个磁道。这n 个文件的检索概率分别是p1, p2, , pn-document optimal disk storage, disk based on documents n f1, f1, fn. each file on disk for a cylinder. N This document retrieval probability were p1, p2, and pn

基于十进制的四叉树的空间数据结构编码。 利用行数和列数求莫顿码 利用莫顿码求行数和列数-Decimal-based quadtree spatial data structure coding. To use the number of rows and columns seeking Morton Morton yards yards seeking to use the number of rows and columns

工作的任务，是负责一个项目的部分代码 对一幅带有人脸信息的24位真彩色bmp文件,通过基于肤色信息的彩色图象分割法,对人脸区域的检测,以及区域标定-On a piece of information with a human face 24 true color bmp files, color information based on color image segmentation method of human face region detection, as well as regional calibration 

数据库小型图书馆管理系统。 使用方便-small library database management system. Easy to use!

c编的一个时钟程序-a series of clock procedures

使用VC编写的约瑟夫环程序，简单明了，方便使用-Prepared using the VC Joseph Central program, simple and clear, easy to use

一种基本算法！ 现有一个酒店有100个房间，依次编号为1到100，第一个服务员经过，将所有房间门关上；第二个服务员经过将所有编号为2的倍数房门打开；第三个服务员经过将所有编号为3倍数的房门打开的关上，关闭的打开。依此类推；输入一个100以内的正整数N，输出第N服务员经过之后，所有房间的状态。-a basic algorithm! An existing 100 hotel rooms, followed by No. 1-100, after an attendant, all rooms will be closed; Second attendants after all No. 2 in multiples door open; Third attendants after all No. 3 multiples of the open door is shut, Guan the opening closed. XII; The importation of a hundred within the positive integer N, N output after attendants, all rooms in the state.

这是一道典型的动态规划题 提供了三种方法(用C++代码实现)-This a typical dynamic programming that provides three methods (using C code realization)