涅槃phy的专栏

首先，什么是水仙花数呢？水仙花数又叫阿姆斯特朗数。具体是什么，请看链接http://baike.baidu.com/link?url=EBzzLpQqAIeFTBaOCwciWJGB0wep4kFHuG8iPg8kQcPk6L7umAFTkp-mAsMHxPoE大概就是说，一个数有n位，这个数的每一位上的数的n次方之和等于这个数，这个数就是水仙花数。大一的时候做过这个题，给一个位数，让

You're given k arrays, each array has k integers. There are kkways to pick exactly one element in each array and calculate the sum of theintegers. Your task is to find the k smallest sums among them.