资 源 简 介
设I是一个n位十进制整数。如果将I划分为k段，则可得到k个整数。这k个整数的乘积称为I的一个k乘积。
编程任务：对于给定的I 和k，编程计算I的最大k乘积。-Set I is an n-bit decimal integers. If I is divided into k above can be k-integer. This is the product of k integers I called a k product. Programming tasks: For a given I and k, the calculation I programmed the largest product k.
