Description: The biggest problem Cuboid a length, width and height, respectively m, n, p of the rectangular cut into m* n* p a small cube. Each cube, there are a whole number. Try to design an algorithm to calculate the largest sub-rectangular cuboid. The size of sub-rectangular by it contains all the integral and defined.
To Search:
- [greatestsoncuboidproblem.Rar] - * Cube : The biggest problem for rectang
- [code] - Algorithm acm C++
- [suanfa] - Set A and B are two strings. Operation w
- [1] - design an O (n2) time algorithm to ident
File list (Check if you may need any files):
zuidachangfang.cpp
Download