WA 2
CODE:
program china;
var
t:char;
i,j,k:integer;
a:array[1..100,1..100] of boolean;
b:array[1..100] of integer;
chk:array[1..100] of boolean;
x,y,q,n,m:integer;

procedure solve(k:integer);
var
i:integer;
begin
for i:=1 to n do begin
if a[k,i] then begin
if not chk[i] then begin
chk[i]:=true;
solve(i);
end;
end;
end;
end;

begin
readln(n);
for i:=1 to n do begin
for j:=1 to n do begin
read(t);
if t='0' then a[i,j]:=false else a[i,j]:=true;
end;
readln;
end;

for i:=1 to n do begin
fillchar(chk,n,false);
solve(i);
for j:=1 to n do begin
if chk[j] then b[i]:=b[i]+1;
end;
end;

readln(q);
for i:=1 to q do begin
readln(x,y);
if b[x]>b[y] then writeln('YES') else writeln('No');
end;
end.