OJ Board

I need some more I/O. PLZ Help.
And I used a ugly method and got WA at about 2 CPU time, which already exceeded the contest time constraints. Any hint I will also be appreciate.

Thanks.

i am getting TLE. complexity of my algorithm is 7 ^ 9. is that ok? can it be done in better time? please help someone

fpavetic wrote:i am getting TLE. complexity of my algorithm is 7 ^ 9. is that ok?

Yeah, I've got accepted with 9 nested loops -- 0.764 sec.

Why 9 nested loop, I used only 7 nested loop, and other 9 numbers can be calculated from the 7 numbers. But I got WA, I don't know why.
Can someone help me ???

then i dont understand why tle

here is my code

there are 9 nested loops: i fill first three columns in first three rows
and the forth column i get subtracting first three from n: the same for forth row

example
board[0][0], board[0][1], board[0][2] - loop
board[0][3] = n - board[0][0] - board[0][1] - board[0][2]
where is my problem

Try to find a 7^7 solution. Its not so hard. Just some math. I can assure u that there exists a 7^7 solution.