简单的演示,N的大小可以改变的,而且这个程序的速度还可以, 比以前我用递归写的那个快多了.如果N改得太大输出会有问题， 因为我用到gotoxy的,这个程...

a code which can constitute a number from keybord to a tr-a code which can constitute a number from keybord to a tree

数据结构的C++PDF文档-data structures of C PDF files

用Excel寫的下載中國台灣股票程式(下載來源為中國台灣証交所),並可選取不同的日期區間繪製股票趨勢圖,大盤指數及kd,MA線,同時工作表內還有各種技術分析說明,內容非常豊富。

一个非常不错的商业进销存软件，用PB写的。-a very good business Invoicing software, used to write the PB.

用于创建多项式并以符合我们习惯的方式显示。还提供了多项式相加的功能-it create a polynomail and display it in the way that satisfy our habite.additonally it provide the function to add two polynomails

约瑟夫问题有原始的约瑟夫和发展了的约瑟夫两种。 原始的约瑟夫的描述： 古代某法官要判决N个犯人的死刑，他有一条荒唐的法律，将犯人站成一个圆圈，从第S个人开始数起，每数到第D个犯人，就拉出来处决，然后再数D个，数到的人再处决―――直到剩下的最后一个可赦免。 发展的约瑟夫的描述： 古代某法官要判决N个犯人的死刑，但这N个人每人持有一个密码，他有一条荒唐的法律，将犯人站成一个圆圈，法官先给出一个密码M，从第S个人开始数起，每数到第M个犯人，就拉出来处决，再根据这个人所持有的密码F，然后再数F个，数到的人再处决，以此类推―――直到剩下的最后一个可赦免。-Joseph problems have original development of the Joseph and Joseph two. The original Joseph Description : Ancient a judge to sentence N inmates of the death penalty, he is a ridiculous law, prisoners station into a circle, from S began a few individuals, every few months to D prisoners, pull out executions, then D, the number of people to be re-executed--- until the last one left to be pardoned. The development of the Joseph Description : Ancient a judge to sentence N inmates of the death penalty, but each individual N holders a password, he is a ridiculous law, prisoners station into a circle, the judges first gave a password M, S individuals from the beginning of several, each of the first few inmates M , pull hi

快速傅立叶变换，实现固定长度的快速傅立叶变换-Fast Fourier Transform, the realization of a fixed length of Fast Fourier Transform

merge sort give a set S of n integers and another integer x, determine whether or not there exits two elements in S whose sum is exactly x.-merge sort give a set of S n integers and anot her integer x, determine whether or not there exits two elemen ts in S whose sum is exactly x.

数据结构 内部排序PPT 希尔排序 快速排序 归并排序-Internal data structure to sort PPT

在9（3*3）个方格的方阵中填入数字1到N(N>=10)内的某9个数字 每个方格填一个整数，要求相邻两个方格的两个整数之和为质数。 试求所有的解-in 9 (3* 3) grid matrix to fill out a number of N (Ngt; = 10) of a nine figures each box filled an integral require two adjacent box at the two integral to the quality and number. Examination for all solutions