文件名称:lading
-
所属分类:
- 标签属性:
- 上传时间:2014-07-21
-
文件大小:1010byte
-
已下载:1次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
拉丁矩阵问题:
现有N种不同形状的宝石,每种宝石有足够多颗。欲将这些宝石排列成m行n列的一个矩阵,m<=n,使矩阵中每一行和每一列的宝石都没有相同形状。试设计一个算法,计算出对于给定的m和n,有多少种不同的宝石排列方案。
算法设计:
对于给定的m和n,计算出不同的宝石排列方案数。
-Latin matrix problem: Existing N different shapes of stones, each gem has enough teeth. The stones are arranged in a matrix wishing m rows and n columns, m < = n, the matrix so that each row and each column do not have the same shape as the jewel. Try to design an algorithm to calculate for a given m and n, there are many different kinds of gems arranged plan. Algorithm Design: For a given m and n, the program calculates the number of different permutations gems.
现有N种不同形状的宝石,每种宝石有足够多颗。欲将这些宝石排列成m行n列的一个矩阵,m<=n,使矩阵中每一行和每一列的宝石都没有相同形状。试设计一个算法,计算出对于给定的m和n,有多少种不同的宝石排列方案。
算法设计:
对于给定的m和n,计算出不同的宝石排列方案数。
-Latin matrix problem: Existing N different shapes of stones, each gem has enough teeth. The stones are arranged in a matrix wishing m rows and n columns, m < = n, the matrix so that each row and each column do not have the same shape as the jewel. Try to design an algorithm to calculate for a given m and n, there are many different kinds of gems arranged plan. Algorithm Design: For a given m and n, the program calculates the number of different permutations gems.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
lading/input.txt
lading/lading.cpp
lading/output.txt
lading/
lading/lading.cpp
lading/output.txt
lading/
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.