OJ Board

you got wrong mean of the problem!! :o
when
0: 0 1 2 3
1:
2:
3:
4: 4 5 6
5:
6:

move 4 onto 1 results:
0: 0 1 4
1: 1
2: 2
3: 3
4:
5: 5
6: 6

while move 4 over 1 results:
0: 0 1 2 3 4
1:
2:
3:
4:
5: 5
6: 6

while pile 4 onto 1 results:
0: 0 1 4 5 6
1:
2: 2
3: 3
4:
5:
6:

while pile 4 over 1 results ...

same error occurs more than once:

/*"BCG";*/
menora[0]=caixas[1]+caixas[2]+caixas[3]+caixas[4]+caixas[6]+caixas[8];
/*"BGC";*/
menora[5]=caixas[1]+caixas[2]+caixas[3]+caixas[5]+caixas[6]+caixas[7];
/*"CBG";*/
menora[1]=caixas[0]+caixas[1]+caixas[4]+caixas[5]+caixas[6]+caixas[8];
/*"CGB ...

The input consists of an NxN array of integers

so, there is only one case in one input, not multiple.

Have you noted follow sentence in problem?

If more than one order of brown, green, and clear bins yields the minimum number of movements then the alphabetically first string representing a minimal configuration should be printed.

I think you note the sentence :wink: , but your code got wrong ...

first , you should format your code more readable before you submit it, then you'll get more help from others. :o
I think your code here
[cpp]for(i=k;i<=n;i++)
{
if(a !=a[i+1])
{
t=a ;
for(j=i;j>k;j--)
a[j]=a[j-1];
a[k]=t;
perm(a,k+1,n);
t=a[k];
for(j=k;j<i;j++)
a[j]=a[j+1 ...

dear comrade Hao,
You can use 3 nesting for() loop, soooooooooo easy, isn't it
If you still don't know how to do it , you can ask Balon Fan directly, HenHenHen

you should pay more attention on the casting between float number to an integer:
if some expression results float number 0, you may got -0.00000000001 for example, then if you cast it to integer, you may got -0, not 0!!
here is my code , it is complex, but it's right
:wink:
[cpp]

#include ...

you should print two end-of-line ('\n') after each test case ( include the last case).
if you print only one '\n' after the last case, you'll got a P.E.
if you print no '\n' after the last case , I think for any problem , you can only got WA :wink:
sample code like this:
[cpp]

for( ; ; )
{
// get ...