资源列表
zuoye11
- 1.编写递归函数计算Fibonacci数列,能避免重复计算 输入:input.txt,仅包含一个整数n(0-90) 输出:程序应能检查输入合法性,若有错误,输出错误提示“WRONG”;否则输出F(n)。两种情况都输出一个回车(形成一个空行)。所有实例均应在30秒内输出结果。 提示:可用一数组保存Fibonacci数列,用一个特殊值表示还未计算出Fibonacci数,递归调用前先检查数组,若已计算,直接取用,不进行递归调用;若未计算,调用递归函数,计算完成后保存入数组。实际上,这
POJ1635.tar
- POJ 1635,树的同构,哈希方法实现-POJ 1635, tree isomorphism, hash method
Mcopy
- 利用java的流进行了创建一个文件夹与一个和文件, 并且判断出,在进行复制文件里的内容-The java stream to create a folder with a file, and the judge during the copy files
n-huang-hou-wenti
- 在C语言环境下编写的N皇后问题,采用的是回溯法实现的-N-queens problem written in C language environment, backtracking implemented
main
- 进行2位十六进制和八位二进制的相互转换,自动识别。-Two hexadecimal and eight binary conversion, automatic identification.
allan
- 用matlab计算allan方差,较为方便、简单-Allan variance calculated using matlab, more convenient and simple
main
- linked lists in C. You have the typedef of the elements and the linked lists.
Vsupply
- interconnect system parameter variation
hanshu
- 离散数学中判断任意一个关系是否为函数,若是函数,判定其是否为单射、满射或双射。-Discrete Mathematics determine whether any of a relationship is a function, if the function to determine whether it is a single shot, full shot or double shot.
aa
- 用于数字控制系统,采样根轨迹法分析,设计离散控制器-For digital control systems, sampling root locus analysis, design discrete controller
BAGpro
- 0-1背包描述如下:有一个贼在偷窃一家商店时发现有N件物品,他希望带走的物品越值钱越好。-0-1 knapsack described as follows: When a thief stealing a shop found N items he wants to take away the goods more valuable as possible.
test
- This is a spice benchmark.