Search found 2 matches

by cycos83
Mon Sep 04, 2006 10:57 am
Forum: Volume 7 (700-799)
Topic: 796 - Critical Links
Replies: 54
Views: 22278

796 help me... Wa... Wa... Wa....

#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[p] , end); } } c...
by cycos83
Wed Jan 18, 2006 10:45 am
Forum: Volume 4 (400-499)
Topic: 453 - Intersecting Circles
Replies: 84
Views: 14540

453 give me some input & output please

my program is WA help me

Go to advanced search