直线加法的实验报告 实现任意二位加法 (a+b)-(c+d)
上传时间： 2013-12-27
上传用户：gxf2016
Romberg求定积分 输入：积分区间[a,b]，被积函数f(x,y,z) 输出：积分结果
上传时间： 2015-10-14
上传用户：妄想演绎师
追赶法解周期性方程 输入：a[],b[],c[],x[] 输出：求解结果X在x[]中
上传时间： 2015-10-14
上传用户：thuyenvinh
用java语言实现了B样条曲线的做法。 可以自由输入控制点，并可以通过鼠标调节控制点的位置。
上传时间： 2015-10-14
上传用户：zgu489
jitter defination of PCIe, and it s analysis theory
标签： defination analysis jitter theory
上传时间： 2013-12-04
上传用户：windwolf2000
很牛B的Mpi并行算法 很牛B的Mpi并行算法 很牛B的Mpi并行算法 很牛B的Mpi并行算法
上传时间： 2013-11-27
上传用户：wcl168881111111
MC9328MX1 自举模式下的b-record 格式代码
上传时间： 2014-01-04
上传用户：hjshhyy
用递规子程序的方法实现HANOI塔问题.子程序模块个数不限. 要求: 盘子个数可以输入,第一个塔为A,第二个塔为B,第三个塔 的名称为C.打印出移动过程.
上传时间： 2013-12-17
上传用户：Yukiseop
HDOJ 1047 One of the first users of BIT s new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numbers. ``This supercomputer is great, remarked Chip. ``I only wish Timothy were here to see these results. (Chip moved to a new apartment, once one became available on the third floor of the Lemon Sky apartments on Third Street.)
标签： supercomputer extended Diller explor
上传时间： 2013-12-22
上传用户：黑漆漆
acm HDOJ 1051WoodenSticks Description: There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to prepare processing a stick. The setup times are associated with cleaning operations and changing tools and shapes in the machine. The setup times of the woodworking machine are given as follows: (a) The setup time for the first wooden stick is 1 minute. (b) Right after processing a stick of length l and weight w , the machine will need no setup time for a stick of length l and weight w if l<=l and w<=w . Otherwise, it will need 1 minute for setup.
标签： WoodenSticks Description length wooden
上传时间： 2014-03-08
上传用户：netwolf
