资源列表
mjdciv
- 将儒略日转化为本地太阳时，很实用，请下载-convert modified julian date to civil date
RareEarthSoftSensor
- 禁忌搜索算法，解决三十个城市间的旅行商问题，求出最短距离-Tabu search algorithm to solve thirty cities between the traveling salesman problem, find the shortest distance
num
- 一个实现输出给定整数所有素数因子的小程序-Achieve a given output all prime factors of a few small programs
daffodils
- 求水仙花数的程序，即判断一个数各个数位立方和是否等于该数-Find a few daffodils procedure to determine a number that is all digital and is equal to the number of cubic
special_function_evaluation
- A fast implementation of many special functions in a single easy to use file I0,I1,J0,J1,K0,K1, Y0,Y1, exponential integrals etc-A fast implementation of many special functions in a single easy to use file I0,I1,J0,J1,K0,K1, Y0,Y1, exponential in
b
- 输入两个正整数m和n，求其最大公约数和最小公倍数-Enter two positive integers m and n, find the greatest common divisor and least common multiple
c-file
- 一球从100m高度自由落下，每次落地后反弹回原高度的一半，在落下，求他再第十次落地时，共经过多少米？第十次反弹多高？-A ball from a height of 100m free fall, bounced back after each fall to half the original height, in the fall, seeking him to the tenth floor, the total, how many meters? How high the tenth b
c-file
- 输入两个整数，求他们相除的余数，用带参的宏来实现-Enter two integers, find the remainder of their division, with a macro with parameters to achieve
mixed-ACS-a-MMAS
- 程序开始运行，蚂蚁们开始从窝里出动了，寻找食物；他们会顺着屏幕爬满整个画面，直到找到食物再返回窝。 其中，‘F’点表示食物，‘H’表示窝，白色块表示障碍物，‘+’就是蚂蚁了。 预期的结果： 各个蚂蚁在没有事先告诉他们食物在什么地方的前提下开始寻找食物。当一只找到食物以后，它会向环境释放一种信息素，吸引其他的蚂蚁过来，这样越来越多的蚂蚁会找到食物！有些蚂蚁并没有象其它蚂蚁一样总重复同样的路，他们会另辟蹊径，如果令开辟的道路比原来的其他道路更短，那么，渐渐，更多的蚂
Relatorio-leo
- The damping factor is the comparison between the square of the frequency and the resonance frequency Neper. In this paper we analyze the variations in the behavior of the circuit when changing resistor values .
up
- A class with recursive member functions Member functions of C++ classes can be recursive. A typical use of recursion is to create a recursive private function to act as a helper for some other member function.-A class with recursive member f
Princess-Dido-story
- 狄多公主圈地的故事 . 为了建设城市，她需要从当地一片森林中的拥有者那里买一些木材，交易条件是这样 的，在有限面积的森林内，散布着一些树木，而不同的树可得到的木材体积也不相同。 狄多需要划出一个圆形区域，区域内的树木皆归她所有，当然，树木分布位置并不规 则。请大家帮助狄多，在树木总数与分布情况，每棵树的可得到的木材体积已知的情况 下，算一下最大可圈出的木材体积是多少。 可以将树木看做平面内的N个点，以点的权值M0，M1，...Mn表示每棵树可出产的木材体 积。圆