OJ Board

What is wrong with my code??????!?!?!?!!!!!!!

My code generates exactly the same result as the 'correct one' above, but got WA!!

Why?!

Grateful for any help! Thanks
[cpp]
#include <iostream>
#include <algorithm>
using namespace std;

void main(){
int route[7] = {2, 3, 1, 5, 3, 4, 5};
int process;

bool edges[21];
do{
edges[2] = 0;
edges[6] = 0;
edges[3] = 0;
edges[15] = 0;
edges[12] = 0;
edges[10] = 0;
edges[5] = 0;
edges[20] = 0;

process = route[0];
if (edges[process])
continue;
else
edges[process] = 1;

process = route[0] * route[1];
if (edges[process])
continue;
else
edges[process] = 1;

process = route[1] * route[2];
if (edges[process])
continue;
else
edges[process] = 1;

process = route[2] * route[3];
if (edges[process])
continue;
else
edges[process] = 1;

process = route[3] * route[4];
if (edges[process])
continue;
else
edges[process] = 1;

process = route[4] * route[5];
if (edges[process])
continue;
else
edges[process] = 1;

process = route[5] * route[6];
if (edges[process])
continue;
else
edges[process] = 1;

process = route[6] * 2;
if (edges[process])
continue;
else
edges[process] = 1;

cout << 1;
for (int i = 0; i < 7; i++)
cout << route;
cout << 2 << endl;

} while (next_permutation(route, route + 7));

}
[/cpp]

help!

malf's post here is a spoiler, REQUESTING MODERATOR'S ATTENTION

if u try to solve it with next_permutation u only have to do two things over each permutation-----

1.check whether it is possible to reach from each element to next element of that permutation or not.
2.check whether one edge overlaps other edge or not.
if u r still getting WA.let me know i will send u the pseudocode over pm.
although,,,better if u solve it with backtrack.
hope it will help.

Output from AC code: