作者meowth (喵猫)
看板puzzle
标题[中译] PuzzleUp 2010 (9) Multiplication
时间Wed Sep 8 19:11:14 2010
首页：
http://www.puzzleup.com/2010/
时限：2010/09/09（四）19:00～09/15（三）18:59
答案可上传５次，但每改１次扣２０分（基本分为１００分）
在比赛期间内可随时回答，但只有在时限内回答者有额外加分
◆Multiplication
You will carry out a multiplication that will implement the steps below:
‧ Place 9 of the 10 digits (0-9) on a 3×3 grid on the condition that
vertically or horizontally neighboring cells do not contain consecutive
digits.
‧ Delete the largest digit in every row.
‧ Multiply the remaining two-digit numbers formed (from left to right) in
every row.
What is the largest product that can be generated through this multiplication?
Example:
1 6 0
7 2 9
3 8 4
If the numbers were placed as above,
then the multiplication yields 24480 (10 ×72×34).
把0-9十个数字中选九个填入3*3的格子中。
相邻的数字不能填在左右或上下相邻的格子。(例如2的上下左右都不能是1 or 3)
然後把每一排最大的数字都删掉，如此会留下三个二位数
再把这三个二位数乘起来得到一个数 请问这个数最大可以多少?
1 6 0
7 2 9
3 8 4
范例: 10*72*34=24480
--
※ 发信站: 批踢踢实业坊(ptt.cc)
◆ From: 218.166.115.195
1F：→ meowth:未想先猜ProgramUp 09/08 19:12
2F：推 puzzlez:人家...人家不玩了啦>"< (滚过来.....又滚过去....) 09/08 19:20
3F：推 ars1an:ProgramUp很简单喔 XD 09/09 02:01
4F：推 lollygagger:这用不着program好贝 09/10 00:00
5F：推 LPH66:同意用不着程式..我在写程式验证之前就想出很接近正解的解了 09/10 08:58
6F：推 weeeeeeeeell:没用程式+1 09/10 18:00