Problem Statement
9 numbers need to be arranged in a magic number square. A magic number square is a square of numbers that is arranged such that every row and column has the same sum. For example:
1 2 3 3 2 1 2 2 2
Create a class MNS containing a method combos which takes as an argument a
Definition
- Class:
- MNS
- Method:
- combos
- Parameters:
- int[]
- Returns:
- int
- Method signature:
- int combos(int[] numbers)
- (be sure your method is public)
Notes
- Unlike some versions of the magic number square, the numbers do not have to be unique.
Constraints
- numbers will contain exactly 9 elements.
- each element of numbers will be between 0 and 9, inclusive.
Examples
{1,2,3,3,2,1,2,2,2}
Returns: 18
{4,4,4,4,4,4,4,4,4}
Returns: 1
{1,5,1,2,5,6,2,3,2}
Returns: 36
{1,2,6,6,6,4,2,6,4}
Returns: 0
{1,2,3,4,5,6,7,8,9}
Returns: 72
{4,4,4,4,4,4,3,3,3}
Returns: 6
{3,2,6,2,3,5,2,6,7}
Returns: 0
{2,6,2,8,9,9,5,7,6}
Returns: 0
{4,6,4,3,5,6,3,5,3}
Returns: 0
{0,0,0,0,9,0,0,0,0}
Returns: 0
{0,0,0,3,3,3,0,0,0}
Returns: 6
{1,2,3,1,2,3,1,2,3}
Returns: 12
{1,2,3,4,5,6,7,8,0}
Returns: 72
{3,4,3,4,3,4,5,5,5}
Returns: 12
{0,2,4,6,8,2,4,6,8}
Returns: 0
{ 4, 4, 5, 6, 7, 8, 9, 2, 3 }
Returns: 72
{ 1, 2, 3, 4, 5, 6, 7, 8, 9 }
Returns: 72
{ 1, 4, 2, 3, 1, 4, 5, 6, 7 }
Returns: 0
{ 1, 5, 1, 2, 5, 6, 2, 3, 2 }
Returns: 36
{ 4, 4, 4, 4, 6, 2, 4, 2, 6 }
Returns: 18
{ 4, 4, 4, 4, 4, 4, 4, 4, 5 }
Returns: 0
{ 1, 1, 1, 1, 1, 1, 1, 1, 4 }
Returns: 0
{ 2, 1, 1, 1, 2, 1, 1, 1, 2 }
Returns: 6