[中譯] PuzzleUp 2010 (9) Multiplication

[meowth (喵貓)]

首頁：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
→ meowth:未想先猜ProgramUp
推 puzzlez:人家...人家不玩了啦>"<   (滾過來.....又滾過去....)
推 ars1an:ProgramUp很簡單喔 XD
推 lollygagger:這用不著program好貝
推 LPH66:同意用不著程式..我在寫程式驗證之前就想出很接近正解的解了
推 weeeeeeeeell:沒用程式+1