OJ Board

i need bfs problems and easy backtracking problems...


sorry for poor english

can anybody say me what is wrong with my code, i got wa

var s,s1:string;
b:array[1..1000] of string;
i,j,n1,n,k,z,l:integer;
begin
repeat
readln(n);
writeln('--');
for i:=1 to n do
readln(b[i]);
readln(n1);
for i:=1 to n1 do begin
readln(s1);
for l:=1 to n do
for k:=0 to 9 do begin
for j:=1 to ...

i got WA can anybody help me plzzzzz

var a:array[1..100000] of byte;
b:array[1..100000] of integer;
i,e,h,k,l,p:integer;
s,g,s1:string;
begin
repeat
readln(e);
if e>0 then begin
inc(h);
b[h]:=e;
readln(s);
readln(g);
l:=0;
p:=0;
s1:='';
for i:=1 to length(g) do begin
k:=0;
while pos(g[i],s ...

please help me, this is WA

what's wrong in this, i getting WA

var a:array[1..100] of shortint;
b:array[1..100] of byte;
i,j,u,z,k,n,r,l:longint;
begin
b[1]:=1;
repeat
inc(i);
readln(a[i]);
until a[i]=0;
n:=i-1;
for i:=1 to n do begin
r:=a[i];
j:=1;
repeat
inc(j);
l:=1;
k:=1;
for z:=2 to r do
b[z]:=0;
repeat
u:=0;
repeat ...

rocky's test cases work on my program

can anybody help me

i always get wa, here is my code:

var n,k:array[1..100000] of longint;
i,j,max,p,k1,f:longint;
function nn(a:longint):integer;
begin
p:=0;
while a<>1 do begin
if a mod 2=0 then a:=a div 2 else a:=(3*a)+1;
inc(p);
end;
nn:=p;
end;
begin
i:=0;
repeat
inc(i);
read(n[i],k[i ...