Problem 90: mathchallenge.net

[exomo]

Hi I need help with problem 90:
(phps. Alvaro or gamma, seen you solved it, but anybody is welcome of course)

(If you take part at mathchallenge.net and have not done anything please don't look)

This is my idea:

1. Create an array that holds all possible arrangements for a cube (from 0,1,2,3,4,5 to 4,5,6,7,8,9)

2. Take every arrangement together with every other and check if the two arrangemente can form all the squarenumbers.
if yes increment a counter.

I'm sure this is not the best/fastest way, but I don't know why it does not work
( I get 772 )

Is my way wrong in some point?

Or is it the following thing I'm not sure about:
{1, 2, 3, 4, 5, 6 } and {1, 2, 3, 4, 5, 9} are distinct, so count both but 6 and 9 can be turned around when it is up to check if they can make a squarenumber

I hope you understand what I'm trying to say.
(I don't want to post any code as others could steal it)
Thanx for any help

[Togra]

You got a PM. I think we should stop discussing problems on the forum, because it's just some sort of spoiling.

Every problem is carefully formulated, so you should be able to solve it totally by yourself. BTW I don't see the fun in not doing it by myself. But if you really need a little hint: PM me.