搜索资源列表
MPI_IO.基于mpi-2 规范的并行i/o方法
- 基于mpi-2 规范的并行i/o方法，以并行矩阵乘法问题为例，比较了并行i/o和串 行i/o的性能，给出了并行i/o方法的应用实例。,Mpi-2 norms based on the parallel i/o approach to parallel matrix multiplication as an example, compare the parallel i/o and serial i/o performance, given the parallel i/o methods of
scrnGen
- 这程序是在做无线点菜产品时弄的，当时开发了一个手持终端，终端屏幕上显示的有些图形内容需要从pc做好点阵后下传。这个程序就是用于在pc上生成点钟信息的，您可能在指定区域内画点、线，或直接输入文字，程序将自动转化为图形点阵的内容存放到指定文件。（本人上传代码均为Fwr原创）-This procedure is in order to do wireless products get, and then developed a hand-held terminals, terminal screen
encryption
- The program takes 3 inputs: 1. A letter of the alphabet that will remain unencoded (e.g. "J") 2. A 5-letter keyword (e.g. "BREAK") 3. A message to be encrypted (e.g. "COMPUTERSCIENCE"). You may assume that it does not contain any spaces or p
poj2814
- Time Limit: 1000ms Memory limit: 65536kB 题目描述 有9个时钟，排成一个3*3的矩阵。 现在需要用最少的移动，将9个时钟的指针都拨到12点的位置。共允许有9种不同的移动。如右表所示，每个移动会将若干个时钟的指针沿顺时针方向拨动90度。 移动 影响的时钟 1 ABDE 2 ABC 3 BCEF 4 ADG 5 BDEFH 6 CFI 7 DEGH 8 GHI 9 EFHI (图 2
4
- 在文件里面有n行数，每行不知道多少个，独处文件中的数，在求出最大公约数。-Within the files have n rows, each line don t know how many alone, the number of documents, the largest companies in the o. Input question formats: The first line a number N, says there are a N matrix Each m
Matrix
- 使用vc++ 6.o制作了一个矩阵模板类 可以使用不同的 数据类型 包含基本矩阵运算 main函数为测试程序-Use vc++ 6.o produced a matrix template class can use different data type contains the main function of the basic matrix operations for the test procedure
Matrix
- 輸入M及N及順逆時針O 建立一個MxN的螺旋矩陣 若O為1則順時針 為2則逆時針-Enter the M and N and O to establish a counter-clockwise spiral MxN matrix if O is a clockwise 2 anticlockwise
G
- 2． 采用相邻矩阵表示一个有向图G，写一个算法确定G是否有一个漏(即入度为n-1，出度为0的顶点)，要求该算法的时间复杂度是o(n2)。-2. Using adjacency matrix represents a directed graph G, G wrote an algorithm to determine whether there is a leak (ie, the degree of n-1, a degree of a vertex is 0), the requiremen
dfs
- 无向图的关键边,dfs邻接阵形式,O(n^2)-The critical edge of the undirected graph, dfs adjacency matrix form, O (n ^ 2)
hungary
- 二分图最大匹配,hungary算法,邻接阵形式,复杂度O(m*m*n)-Bipartite graph maximum matching, hungary algorithm, adjacency matrix form, complexity O (m* m* n)
di806
- Relief computing classification weight, For beginners with a reference value, Calculate the maximum eigenvalue judgment matrix of AHP.
矩阵运算程序
- 程序包含矩阵加减、转置和乘法的功能，用于学习动态内存分配、结构体、二级指针、文件I/O.(The program contains the function of matrix addition, subtraction, and multiplication, which is used to learn dynamic memory allocation, structure, two level pointer, file I/O)