OJ Board

so it's like the second way i've tried to solve,
makin a topological sort then a dfs where each spanning tree root is a light that must be turn on..
like this..


REMOVED AFTER AC;



@edit..
can't believe this, I was making the worst mistake ¬¬'
my output was..
printf("%d\n", answer );
instead ...

I've tried to solve this one using two different approaches,

first one, finding the number of strongly connected components that don't have in-arcs from other scc;
and the other making kind of a topological sort, adding the vertices in a list as they're discovered in a dfs, then, each root of a ...

well guys, after take a look in some previous posts I could fix the RTE I was receiving,
but now WA is chasing me.
Maybe somebody could find what I'm doing wrong.

#include <stdio.h>
#include <stdlib.h>

void newTable( char x[][252] ){

int i, j;

for(i = 0; i<252; i++){
for( j = 0; j<252; j ...

A tip is look the way data input is made.
blank lines between the test cases can generate a WA.

well, I think it's allright with my code.
tried all I could but still get WA.
some tips ?