资源列表
BTP-Report-Format
- format of btech report in doc format
PrimNumJuge
- 素数-Prime number................................
lyapunov
- Lyapunov exponent algorithm
gs
- 全主元高斯消元法，动态二维数组的建立，以及实现例子-All principal component Gaussian elimination
heat-transfer
- 一维非稳态传热fortran程序，对流体力学初学者非常有用-Fortran one-dimensional unsteady heat transfer process is very useful for beginners of fluid mechanics
check_ec
- 制作micaps欧洲数值模式检验024、048、072的综合图实时生成程序-to check the products with different prescr iption of european numerical model
deira4
- 1-D 3-T hydro code for simulating ion-driven ICF targets
8yingbi
- 在八枚外观相同的硬币中，有一枚是假币，并且已知假币与真币的重量不同，但不知道假币与真币相比较轻还是较重。可以通过一架天平来任意比较两组硬币，设计一个高效的算法来检测出这枚假币-In the eight coins look the same, there is a counterfeit money and counterfeit currency and real currency known to the weight of different, but do not know the re
shiyan3
- 设p1=(x1, y1), p2=(x2, y2), …, pn=(xn, yn)是平面上n个点构成的集合S，设计算法找出集合S中距离最近的点对。-Let p1 = (x1, y1), p2 = (x2, y2), ..., pn = (xn, yn) is the plane the set of n points S, S in the design algorithm to find the nearest collection point right.
8queen
- 8 queen problem coded in c.
gongyueshu
- 由欧几里得，连续整数检测，分解质因数算法得最大公约数，并分析各种算法的时间性-By the Euclid, consecutive integers detection, decomposition of the prime factors have the greatest common divisor algorithm, and analyze the timing of various algorithms
knight
- 在n行n列的棋盘上（如n=5），假设一位骑士（按象棋中“马走日”的行走法）从初始坐标位置(x1，y1)出发，要遍访（巡游）棋盘中的每一个位置一次。请编一个程序，为骑士求解巡游“路线图”（或告诉骑士，从某位置出发时，无法遍访整个棋盘 — 问题无解）。-In the n-n chessboard (for example, n = 5), assuming a knight (in chess in the " horse to go on" walk method) from t