-
这是一个骑士问题的程式,虽然作法不是很好~有点暴力~但是跑出来还OK!...
这是一个骑士问题的程式,虽然作法不是很好~有点暴力~但是跑出来还OK!-This is a knight of the program, although the practice was not very good- a little violence- but also come out OK!
- 2022-10-23 08:55:03下载
- 积分:1
-
NETEM 的预测试题
NETEM 的预测试题-NETEM questions
- 2022-06-21 17:58:58下载
- 积分:1
-
kaba key 2009
kaba key 2009
kaba key 2009
kaba key 2009
- 2022-07-23 11:13:29下载
- 积分:1
-
操作系统课程设计,关于操作系统经典问题读者写者问题的演示!...
操作系统课程设计,关于操作系统经典问题读者写者问题的演示!-courses on operating system design, operating system classic problem of the readers who write the demo!
- 2022-04-09 12:41:16下载
- 积分:1
-
控制卡应用软件
运动控制卡应用事例程序,对编程人员很方便。-control card application software
- 2022-04-07 03:17:10下载
- 积分:1
-
Image Registration of the literature, including genetic algorithm, mutual inform...
图像配准的文献,包括遗传算法,互信息法,免疫算法,中英文经典文献-Image Registration of the literature, including genetic algorithm, mutual information method, the immune algorithm, in both English and Chinese classical literature
- 2023-08-03 22:20:05下载
- 积分:1
-
lottery software source code (delphi source
彩票软件源代码(delphi源码-其它源码).rar-lottery software source code (delphi source-other source). Rar
- 2022-07-01 14:08:45下载
- 积分:1
-
计算一个非负整数矩阵的铪质。注:复制铪质。C的方法。
Computes the hafnian of a nonnegative integer matrix. Notes: Copy hafnian.c to main.c, in the same directory as Rothberg s code (see above). You can download the .tar directory with the code weighted-match.tar here. Then "make" the codes (this codes are in C, not C++). The program is then run by the command "wmatch". -Computes the hafnian of a nonnegative inte ger matrix. Notes : Copy hafnian.c to main.c, in the same directory as Rothberg"s code (see abo ve). You can download the. tar directory with th e code weighted-match.tar here. Then "make" th e codes (this codes are in C, not C). The program is then run by the command "wm atch. "
- 2022-01-30 19:38:32下载
- 积分:1
-
Allegro对齐小工具
对于使用Allegro做Layout的同行们来说,使用Skill开发的各种各样的小工具无疑会及大地提高绘图效率,这里提供一款对齐工具,安装方法和使用方法在压缩包里有说明,欢迎使用。
- 2023-04-09 06:00:02下载
- 积分:1
-
一堆猴子都有编号,编号是1,2,3 ...m ,这群猴子(m个)按照1...
一堆猴子都有编号,编号是1,2,3 ...m ,这群猴子(m个)按照1--m的顺序围坐一圈,从第1开始数,每数到第N个,该猴子就要离开此圈,这样依次下来,直到圈中只剩下最后一只猴子,则该猴子为大王。-monkeys have a pile of numbers, numbers 1, 2, 3 ... m, these monkeys (m) In accordance with the 1-- m sitting in the order in a circle, starting from a few every few months to the first N, The monkeys will be leaving this ring, and so on down until the circle only last a monkey, the monkey king to.
- 2022-01-25 16:09:22下载
- 积分:1