搜索资源列表
HanoiTowerSequence
- 题目大意： 经典的汉诺塔 n个盘编号，从小到大 1..n 问：移动的序列中第k步移的是哪个盘 -Input The first line of the input file is T, the number of test cases. Each test case contains one integer p (1<=p<10^100). Output Output the pth e
FiveDirectionPad_Algo
- 此作業需使用Backtracking algorithm 從第一格開始，從1到9依序測試是否可以填入，若本來此格已有數字，則直接往下一格走。若可以填入( if(promising()) )則填入該數字並且往下一格移動繼續填，若此格沒有可填入的數字時，則結束該格的動作，回到上一格去測試剩下的可能結果。若已經填完( if(solution is found) )，則可能解+1，然後回到前面再繼續尋找接下來的可能解。直到全部可能的數字組合都試完之後，程式結束，所有可能解的個數也會被找到。需要印出的
Netcdf_f90
- 读取netCDF格点资料的Fortran测试程序，通过读取指定netCDF文件，生成相应的Fortran源代码- Test program to read any netCDF file. by Barry Schwartz October 1993
sparsematrix
- 求解大型对称或非对称方程组，采用稀疏矩阵存储及求解算法，在电力系统仿真分析软件中得到应用-Sparse1.3 is a flexible package of subroutines written in C used to quickly and accurately solve large sparse systems of linear equations. The package is able to handle arbitrary real and complex
task
- Python入门练习,Question 2: buyLotsOfFruit function Add a buyLotsOfFruit(orderList) function to buyLotsOfFruit.py which takes a list of (fruit,pound) tuples and returns the cost of your list. If there is some fruit in the list which doesn t appear in
sgu262
- sgu262：Symbol Recognition(状压DP) 题目大意： 给出k个n∗ m的01矩阵Si，求出一个1尽量少的n∗ m的01矩阵P，满足k个矩阵与该矩阵的交互不相同，也就是说通过该矩阵能表示出给出的k个矩阵。-262. Symbol Recognition time limit per test: 0.25 sec. memory limit per test: 65536 KB input: standard output: