OJ Board

i dont know why i got WA, im just checking if the first cube and the second cube are the same without any 'rotation' tables. is it possible that the cubes are the same but you cant rotate one to get the second one? here is my algorithm: i remember face 1 color on the first cube, search for that ...

why do i got TLE??

[cpp]
#include <iostream.h>
#include <queue>

using std::queue;

void main()
{
int a[110][110], i, j, n, p, q, inNum, nNum, fr;
bool in[110];
while (1) {
cin >> n;
if (n == 0)
break;

for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
a [j] = 0;
while (1) {
cin >> p;
if ...

thanks for you help i got AC now

i got WA after my program running about 1 second!!!
is there any trick in this problem?? :cry: :(

[cpp]
#include <iostream.h>
#include <stack>
#include <stdlib.h>

using std::stack;

void main()
{
int br, W, SN;
char a, integer[15];
stack<int> weight;
stack<int> subnum;
int sum, I, q, i;
bool ...

whats wrong with my code? i got WA after 0,184 sec working!
is there any trick in this problem?

help please