Overview In this chapter I introduce Borland C++Builder (BCB) and explain what it is about. I also devote considerable time to explaining the purpose of this book and the philosophy behind my approach to technical writing. Technical subjects covered in this chapter include Creating a simple Multimedia RAD program that plays movies, WAV files, and MIDI files. Shutting down the BCB RAD programming tools and writing raw Windows API code instead. Creating components dynamically on the heap at runtime. Setting up event handlers (closures) dynamically at runtime. A brief introduction to using exceptions. This topic is covered in more depth in Chapter 5, "Exceptions." A brief introduction to ANSI strings. This subject is covered in more depth in Chapter 3, "C++Builder and the VCL." Using the online help. Greping through the include and source files that come with the product and with this book.
The subject which is to us propos¨¦ is as follows: calculation of the degr¨¦ d¡ ¯ inconsistance d¡ ¯ un logical program possibilist in C++. We thus work on a logical program possibilist, it be-¨¤-statement a logical program resulting from non-classique logic. The goal first of this project is of d¨¦ terminer if a logical program is consisting or not of share the calculation of sound degr¨¦ d¡ ¯ inconsistance.
數字運算，判斷一個數是否接近素數
A Niven number is a number such that the sum of its digits divides itself. For example, 111 is a Niven number because the sum of its digits is 3, which divides 111. We can also specify a number in another base b, and a number in base b is a Niven number if the sum of its digits divides its value.
Given b (2 <= b <= 10) and a number in base b, determine whether it is a Niven number or not.
Input
Each line of input contains the base b, followed by a string of digits representing a positive integer in that base. There are no leading zeroes. The input is terminated by a line consisting of 0 alone.
Output
For each case, print "yes" on a line if the given number is a Niven number, and "no" otherwise.
Sample Input
10 111
2 110
10 123
6 1000
8 2314
0
Sample Output
yes
yes
no
yes
no
[輸入]
圖的頂點個數N，圖中頂點之間的關系及起點A和終點B
[輸出]
若A到B無路徑，則輸出“There is no path” 否則輸出A到B路徑上個頂點
[存儲結構]
圖采用鄰接矩陣的方式存儲。
[算法的基本思想]
采用廣度優先搜索的方法，從頂點A開始，依次訪問與A鄰接的頂點VA1,VA2,...,VAK, 訪問遍之后,若沒有訪問B，則繼續訪問與VA1鄰接的頂點VA11,VA12,...,VA1M，再訪問與VA2鄰接頂點...，如此下去，直至找到B，最先到達B點的路徑，一定是邊數最少的路徑。實現時采用隊列記錄被訪問過的頂點。每次訪問與隊頭頂點相鄰接的頂點，然后將隊頭頂點從隊列中刪去。若隊空，則說明到不存在通路。在訪問頂點過程中，每次把當前頂點的序號作為與其鄰接的未訪問的頂點的前驅頂點記錄下來，以便輸出時回溯。
#include<stdio.h>
int number //隊列類型
typedef struct{
int q[20]
The XML Toolbox converts MATLAB data types (such as double, char, struct, complex, sparse, logical) of any level of nesting to XML format and vice versa.
For example,
>> project.name = MyProject
>> project.id = 1234
>> project.param.a = 3.1415
>> project.param.b = 42
becomes with str=xml_format(project, off )
"<project>
<name>MyProject</name>
<id>1234</id>
<param>
<a>3.1415</a>
<b>42</b>
</param>
</project>"
On the other hand, if an XML string XStr is given, this can be converted easily to a MATLAB data type or structure V with the command V=xml_parse(XStr).
KMEANS Trains a k means cluster model.CENTRES = KMEANS(CENTRES, DATA, OPTIONS) uses the batch K-means
algorithm to set the centres of a cluster model. The matrix DATA
represents the data which is being clustered, with each row
corresponding to a vector. The sum of squares error function is used.
The point at which a local minimum is achieved is returned as
CENTRES.
