Search - n2-1 - CodeBus

Search - n2-1 - List

[Windows Develop] testautomation DL : 0: 这是一个automation server 和 client 的演示程序多个client 可以共享 server 进程首先用ms vc++ .net 编译代码，再运行 TestAutomation3.exe (server) 然后可以运行多个 TestAutomation2.exe (client) 单击 TestAutomation2 可以调用 TestAutomation3 中的方法和参数 -This is an automation server and client demonstration program over cl ient can share server process first used ms vc. net compiled code, re-running TestAutomation3.exe (server) can then be run multiple Te stAutomation2.exe (client) Click TestAutomatio n2 TestAutomation3 can call the method and parameters
Date : 2008-10-13 Size : 89.54kb User : 大名
[Windows Develop] 一维最近点（传统法）1 DL : 0: 该程序实现对一维数据轴上的最临近点的求解问题采用方法：计算每对顶点间的距离，比较之效率为O(n2)-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : for each pair of vertices the distance, a comparison of the efficiency of O (n2)
Date : 2008-10-13 Size : 1.99kb User : 杨晨
[Windows Develop] 一维最近点（传统法）1 DL : 0: 该程序实现对一维数据轴上的最临近点的求解问题采用方法：计算每对顶点间的距离，比较之效率为O(n2)-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : for each pair of vertices the distance, a comparison of the efficiency of O (n2)
Date : 2026-01-08 Size : 2kb User : 杨晨
[Windows Develop] testautomation DL : 0: 这是一个automation server 和 client 的演示程序多个client 可以共享 server 进程首先用ms vc++ .net 编译代码，再运行 TestAutomation3.exe (server) 然后可以运行多个 TestAutomation2.exe (client) 单击 TestAutomation2 可以调用 TestAutomation3 中的方法和参数 -This is an automation server and client demonstration program over cl ient can share server process first used ms vc. net compiled code, re-running TestAutomation3.exe (server) can then be run multiple Te stAutomation2.exe (client) Click TestAutomatio n2 TestAutomation3 can call the method and parameters
Date : 2026-01-08 Size : 89kb User :
[Windows Develop] ImgRotate DL : 0: Dim DP() As Byte, c As Long, d As Long Dim i As Long, j As Long Dim Color As Long, SRad As Double, CRad As Double Dim p As Double, q As Double, m As Double, n As Double Dim m1 As Double, n1 As Double, m2 As Double, n2 As Double, t As RGB, t1 As RGB, t2 As RGB, t3 As RGB, t4 As Long Color = BackColor \ 65536 \ 8 + ((BackColor \ 256 Mod 256) \ 4) * 32 + ((BackColor Mod 256) \ 8) * 2048-Dim DP() As Byte, c As Long, d As Long Dim i As Long, j As Long Dim Color As Long, SRad As Double, CRad As Double Dim p As Double, q As Double, m As Double, n As Double Dim m1 As Double, n1 As Double, m2 As Double, n2 As Double, t As RGB, t1 As RGB, t2 As RGB, t3 As RGB, t4 As Long Color = BackColor \ 65536 \ 8+ ((BackColor \ 256 Mod 256) \ 4)* 32+ ((BackColor Mod 256) \ 8)* 2048
Date : 2026-01-08 Size : 106kb User : zhou
[Windows Develop] 4 DL : 0: 将正整数n表示成一系列正整数之和：n=n1+n2+…+nk，其中n1≥n2≥…≥nk≥1，k≥1。正整数n的这种表示称为正整数n的划分。求正整数n的不同划分个数。例如正整数6有如下11种不同的划分： 6； 5+1； 4+2，4+1+1； 3+3，3+2+1，3+1+1+1； 2+2+2，2+2+1+1，2+1+1+1+1； 1+1+1+1+1+1。-Positive integer n will be expressed as the sum of a series of positive integers: n = n1+ n2+ ...+ nk, of which n1 ≥ n2 ≥ ... ≥ nk ≥ 1, k ≥ 1. Positive integer n such that n is called the division of positive integer. For positive integer n the number of different division. Positive integer 6, for example, the following 11 kinds of different division: 6 5+1 4+2,4+1+1 3+3,3+2+1,3+1+1+1 2+2+ 2,2+2+1+1,2+1+1+1+1 1+1+1+1+1+1.
Date : 2026-01-08 Size : 1kb User : yuecuiping
[Windows Develop] n2 DL : 0: Niagara-2 RNG driver for Linux,welcom to download.
Date : 2026-01-08 Size : 4kb User : 淘爱77
[Windows Develop] n2-drv DL : 0: SDL Inc. RISCom/N2 synchronous serial card driver for Linux
Date : 2026-01-08 Size : 5kb User : zhouxing894
[Windows Develop] SelectionSort DL : 0: In computer science, selection sort is a sorting algorithm, specifically an in-place comparison sort. It has O(n2) time complexity, making it inefficient on large lists, and generally performs worse than the similar insertion sort.
Date : 2026-01-08 Size : 1kb User : Linh Nguyen
[Windows Develop] 自然连接 DL : 0: 计算任意两个表的简单自然连接过程。假设有两个表A、B，分别为m1行、n1列和m2行、n2列，求它们简单自然连接的结果C=A B(i=j)。(A simple natural join procedure for computing two arbitrary tables. Suppose there are two tables A and B, which are M1 rows, N1 columns and M2 rows, N2 columns, and the result of their simple natural connection is C=A B (i=j).)
Date : 2026-01-08 Size : 117kb User : nativefaith
[Windows Develop] aaa DL : 0: 采用最小二乘法计算八个分潮M2，S2，N2，K2，K1，O1，P1和Q1的调和常数，进行潮位自报，与给定的潮位进行比较（画图）并计算方差，在结果验证的基础上进一步模拟潮位位变化(The harmonic constants of eight tides M2, S2, N2, K2, K1, O1, P1 and Q1 were calculated by the least square method. The tidal level was self-reported, compared with the given tide level (drawing) and the variance was calculated, and the tidal level change was simulated on the basis of the results)
Date : 2026-01-08 Size : 6kb User : 宇翌
[Windows Develop] 奇数阶魔阵问题 DL : 0: 魔阵是用自然数1，2，3…，n2填n阶方阵的各个元素位置，使方阵的每行的元素之和、每列元素之和及主对角线元素之和均相等。奇数阶魔阵的一个算法是将自然数数列从方阵的中间一行最后一个位置排起，每次总是向右下角排（即Aij的下一个是Ai+1,j+1）。但若遇以下四种情形，则应修正排数法。　　（1）列排完（即j=n+1时），则转排第一列; 　　（2）行排完（即i=n+1时），则转排第一行; 　　（3）对An,n的下一个总是An,n-1; 　　（4）若Aij已排进一个自然数，则排Ai－1，j－2。(The array is 1, 2, 3 with natural numbers. N2 fills the positions of each element of the n order matrix, making the sum of the elements of each row, the sum of the elements of each row and the main diagonal elements equal. An odd order magic array is an algorithm that sets the number of natural numbers from the last line of the middle of the matrix and always rows to the right lower corner (that is, the next of Aij is Ai+1, j+1). But in the following four situations, it should be modified row number method. (1) when row is finished (i.e. j=n+1), the first column is transferred. (2) row row (i.e. i=n+1), then transfer to the first row. (3) for An, the next n is always An, n-1; (4) if Aij has been discharged into a natural number, then row Ai 1, j 2.)
Date : 2026-01-08 Size : 15kb User : What111