搜索资源列表
heap
- 从多列有序数据中找出总排名靠前的数据,适用于学生成绩管理中,每科成绩按顺序排好,找出总成绩最高的学生,使用了堆排算法,速度更快。-Ordered the data from multiple columns to find out the overall top-ranking data for student performance management, performance for each subject according to the order of line up to ide
yinshi
- 隐式格式:污染物在一维河流中扩散的简单数值仿真C程序-Implicit scheme: the spread of pollutants in the one-dimensional river simple numerical simulation C program
2
- 在n*n的棋盘上(1<=n<=10)填入1、2、3、….、n*n,共有n*n个数,使得任意相邻数的和为素数。 输入:n 输出:若有多个解,则需输出第一行、第一列之和均为最小的排列方案;若无解,则输出‘no’。-On board n* n (1 <= n <= 10) filled with 1,2,3, ...., N* n, a total number of n* n, so that any adjacent, and the number of prime
王敬贤-SA16168143-第5次作业
- 设计算法解决拉丁矩阵问题,将n种不同形状的宝石排列成m行n列的一个矩阵,每一行每一列的宝石都没有相同形状,求宝石排列方案数(Latin matrix design algorithm to solve the problem, the gem n different shapes arranged in m rows n columns of a matrix, each row of each column of gems don't have the same shape, strives