搜索资源列表
xzhdx
- 不过可以提示一下,将金额4位一分,比如1234567可以拆分为1234和567.另外,数字中间有零的话必须写零,但要注意多个零的情况.详细的怎么写你可以问问做财务的人.-But it is suggested that the amount of a sub-4, For example, 1234567 can be split for the 1234 and 567. In addition, the number of middle zero zero must write, but b
TETRA_aclep
- TETRA系统中使用的ACELP编码程序，通过VS2008编译并仿真成功，可以听ACELP解压后的语音。4.567kbps-TETRA system used in the ACELP coding process through the VS2008 compile and simulation successfully, you can listen to the voice ACELP after decompression. 4.567kbps
xunhuansai
- 用分治算法生成循环赛日程表（1到2的n次方个人）输入： 一个整数n 输出： 循环赛日程表（1到2的n次方个人） 输入样例： 3 输出样例： 1 2 3 4 5 6 7 8 2 1 4 3 6 5 8 7 3 4 1 2 7 8 5 6 4 3 2 1 8 7 6 5 5 6 7 8 1 2 3 4 6 5 8 7 2 1 4 3 7 8 5 6 3 4 1 2 8 7 6 5 4 3 2 1-
nihe
- 已知一组实验数据 1 2 3 4 5 6 7 8 9 1 3 4 5 6 7 8 9 10 10 5 4 2 1 1 2 3 4 试用最小二乘法求它的多项式拟合曲线，并求出最低点的位置. -1,234,567,891,345,678,910 10 5 4 2 1 1 2 3 4 trial Least Squares Method polynomial fitting curve, and obtained a set of known experim
SMExport.Suite.v4.50.for.Delphi.567.(by.bigN)
- SMExport suite 4.99 is a component set for data export from TDataSet or TDBGrid or any other VCL control (TStringGrid, TListView etc) into the Paradox and DBase tables (using BDE) or into a text file (fixed or comma-delimited), HTML, XML, MS Excel, M
216
- 求任意的一个m×m矩阵的最大数及其所在的行列数，m(2<=m<=20)及矩阵元素从键盘输入(只考虑int型)。编程可用素材：printf("Please input m: ")、printf("\nPlease input array:\n")、printf("\nmax=…,i=…,j=…\n"…。 程序的运行效果应类似地如图1所示，图1中的5和 1 45 67 235 464 35 6 89 32342 8 347 9346 47 9
1042_左儿子右兄弟
- 输入一棵左儿子右兄弟表示的树，输出它(按照正常表示的)前序、后序和层次遍历的结果。 [左儿子右兄弟表示法是一种精神，务必领会] 样例说明： 2 /|\ 1 3 4 / \ \ 5 6 7(Enter a tree expressed by the right brother of a left son, and output the result of the tree, which is traversed by the preorder, the p