g*********s
发帖数: 1782 | 1 看了那个彭博社面试题想起来的。我记得以前在数学书上看到过系统讨论。大致是说，
N个钞票面值，表
示任意M元以内。N要尽量少，同时总的钞票数量也要少，是一个限制优化问题。
人民币1，2，5，10应该是最优解或比较好的次优解。 | m*********g
发帖数: 646 | 2 that question is testing the binary knowledge, a common question in quant
interviews. The 31 is the hint.
so , it is 1, 2, 4, 8, 16 , can represent every number 1~31.
For the real money system, it needs to consider people's convenience. | g*********s
发帖数: 1782 | 3 1 is enough.
given ur answer, it must have required each type only appears once.
if so it's a strong hint.
【在 m*********g 的大作中提到】
: that question is testing the binary knowledge, a common question in quant
: interviews. The 31 is the hint.
: so , it is 1, 2, 4, 8, 16 , can represent every number 1~31.
: For the real money system, it needs to consider people's convenience.
| m*********g
发帖数: 646 | 4 pls, think it again.
【在 g*********s 的大作中提到】
: 1 is enough.
: given ur answer, it must have required each type only appears once.
: if so it's a strong hint.
| g*********s
发帖数: 1782 | 5 what's the complete description of the problem?
given lz's description, 1 is enough to represent any #.
【在 m*********g 的大作中提到】
: pls, think it again.
| c******n
发帖数: 4965 | 6 how do u PROVE it's the min? that's the difficult part
【在 g*********s 的大作中提到】
: 看了那个彭博社面试题想起来的。我记得以前在数学书上看到过系统讨论。大致是说，
: N个钞票面值，表
: 示任意M元以内。N要尽量少，同时总的钞票数量也要少，是一个限制优化问题。
: 人民币1，2，5，10应该是最优解或比较好的次优解。
|
|
