OJ Board

#include <stdio.h>
#include <algorithm>

using namespace std;

int map[1001][1001], n, check[1001], sum, save[1001][1001], num[1001];

void DFS(int p, int end)
{
int i;
if(p == end)
{
sum++;
return;
}
check[p]=1;
for(i=1;i<=map[p][0];i++)
{
if(check[map[p] ]==0 && map[p] !=p)
{
DFS(map ...

my program is WA help me