tag:blogger.com,1999:blog-18400048.post345578376804987858..comments2008-10-29T14:18:20.714+09:00Kosei Kitaharahttp://www.blogger.com/profile/15440023982376653770surgo.jp@gmail.comBlogger2125tag:blogger.com,1999:blog-18400048.post-2062991404187926602008-10-29T14:18:20.714+09:002008-10-29T14:18:20.714+09:00&gt;&gt; Ianさん<BR/>ありがとうございます＾＾<BR/>問題<BR/>You have a n x n board and several checkers placed on it. The i-th checker is in the cell at row x[i], column y[i]. All coordinates are 1-based. There can be more than one checker in the same cell. A move consists of taking one checker and moving it one cell up, down, left or right.<BR/>You want to put each checker in one of the four corners of the board. Return the minimum number of moves necessary to achieve the goal.<BR/>定義<BR/>Class:<BR/>TheSimpleGame<BR/>Method:<BR/>count<BR/>Parameters:<BR/>int, int[], int[]<BR/>Returns:<BR/>int<BR/>Method signature:<BR/>int count(int n, int[] x, int[] y)<BR/>(be sure your method is public)<BR/><BR/>です。。。Surgohttp://www.blogger.com/profile/15440023982376653770noreply@blogger.comtag:blogger.com,1999:blog-18400048.post-87942111522000541772008-10-29T13:40:00.000+09:002008-10-29T13:40:00.000+09:00問題の内容は？Ian Lewishttp://www.blogger.com/profile/16235834286436870828noreply@blogger.com