Here is my program
It always gets CRASH?
Could you tell me why, please?

program staircase;
const max=500;
var n,i,j:longint;
a:array[0..max,0..max]of real;
 procedure br(n:integer);
 var i,j:integer;
 begin
 for i:=1 to n do
 for j:=1 to n do
 if j=1 then a[i,j]:=0
 else if (j*(j+1)div 2)<i then a[i,j]:=0
 else if j=i then a[i,j]:=1+a[j,j-1]
 else if (j=i-1)then a[i,j]:=1+a[i,j-1]
 else if j>i then a[i,j]:=a[i,i]
 else a[i,j]:=a[i-j,j-1]+a[i,j-1];
 end;
begin
readln(n);
br(n);
writeln(round(a[n,n]-1));
end.


Thank you!

71222119
mailto : trungduck@yahoo.com

My program pass every test data which were designed by
myself.
I want to know if there are some special test data,please
show me.Thanks!

*u**

Var Text                : Array[1..10001] of Char;
    Long                : Integer;
    D1,D2               : Integer;
    Now                 : Integer;

Procedure Init;
Var S     : String;
    i     : Integer;
Begin
  Long := 0;
  Repeat
    Readln(S);
    For i := 1 to Length(S) do
      If S[i]<>#0 then
        Text[Long+i] := S[i];
    Inc(Long,Length(S));
  Until S='';
End;

Procedure Main;
Var i,j : Integer;
      P : Integer;
Begin
  P := 0;
  Now := 0;
  Repeat
    Inc(P);
    If Text[P]+Text[P+1]='(*' then
      Begin
        Inc(D1);
        Now := 2;
        Inc(P);
        Continue;
      End;
    If Now=2 then
      If Text[P]+Text[P+1]='*)' then
        Begin
          Dec(D1);
          If D1=0 then
            Begin
              If D2<>0 then Now := 1
                       else Now := 0;
            End;
          Inc(P);
          Continue;
        End;
    If Now<2 then
      Begin
        If Text[P]='(' then
          Begin
            Inc(D2);
            Now := 1;
            Continue;
          End;
        If Text[P]=')' then
          Begin
            Dec(D2);
            If D2=0 then Now := 0;
            Continue;
          End;
      End;
      If Now=1 then
        If Not(Text[P] in ['(',')','0'..'9','+','-
','*','/','=']) then
          Begin
            Writeln('No');
            Halt;
          End;
    If Now=0 then
      If Text[P]=')' then
        Begin
          Writeln('No');
          Exit;
        End;
  Until P=Long;
  If (D1<>0) or (D2<>0) then
    Begin
      Writeln('No');
      Exit;
    End;
  Writeln('Yes');
End;

Begin
  Init;
  Main;
End.

{Help!What's wrong with my problem?}
Var Text                : Array[1..10001] of Char;
    Long                : Integer;
    D1,D2               : Integer;
    Now                 : Integer;

Procedure Init;
Var S     : String;
    i     : Integer;
Begin
  Long := 0;
  Repeat
    Readln(S);
    For i := 1 to Length(S) do
      If S[i]<>#0 then
        Text[Long+i] := S[i];
    Inc(Long,Length(S));
  Until S='';
End;

Procedure Main;
Var i,j : Integer;
      P : Integer;
Begin
  P := 0;
  Now := 0;
  Repeat
    Inc(P);
    If Text[P]+Text[P+1]='(*' then
      Begin
        Inc(D1);
        Now := 2;
        Inc(P);
        Continue;
      End;
    If Now=2 then
      If Text[P]+Text[P+1]='*)' then
        Begin
          Dec(D1);
          If D1=0 then
            Begin
              If D2<>0 then Now := 1
                       else Now := 0;
            End;
          Inc(P);
          Continue;
        End;
    If Now<2 then
      Begin
        If Text[P]='(' then
          Begin
            Inc(D2);
            Now := 1;
            Continue;
          End;
        If Text[P]=')' then
          Begin
            Dec(D2);
            If D2=0 then Now := 0;
            Continue;
          End;
      End;
      If Now=1 then
        If Not(Text[P] in ['(',')','0'..'9','+','-
','*','/','=']) then
          Begin
            Writeln('No');
            Halt;
          End;
    If Now=0 then
      If Text[P]=')' then
        Begin
          Writeln('No');
          Exit;
        End;
  Until P=Long;
  If (D1<>0) or (D2<>0) then
    Begin
      Writeln('No');
      Exit;
    End;
  Writeln('Yes');
End;

Begin
  Init;
  Main;
End.

Here is my program
It always gets CRASH?
Could you tell me why, please?

program staircase;
const max=500;
var n,i,j:longint;
a:array[0..max,0..max]of real;
 procedure br(n:integer);
 var i,j:integer;
 begin
 for i:=1 to n do
 for j:=1 to n do
 if j=1 then a[i,j]:=0
 else if (j*(j+1)div 2)<i then a[i,j]:=0
 else if j=i then a[i,j]:=1+a[j,j-1]
 else if (j=i-1)then a[i,j]:=1+a[i,j-1]
 else if j>i then a[i,j]:=a[i,i]
 else a[i,j]:=a[i-j,j-1]+a[i,j-1];
 end;
begin
readln(n);
br(n);
writeln(round(a[n,n]-1));
end.


Thank you!

I don't know why i am get WA.
Admin can you send me any tests and solutions.
Anyone can help me find the errors:

{I use dynamic programming}
Program ACM1018;
Const max=100;
Var n,q,t:byte;
    qhd:array[0..max,0..max] of longint;
    mg1:array[0..100] of record
rank,n1,n2:byte;app:integer;end;
    mg:array[1..100] of record i,j:byte;k:integer;end;

Procedure readin;
Var i,count:byte;
Begin
     Readln(n,q);if q=n then q:=n-1;
     For i:=1 to n-1 do
         begin
         readln(mg[i].i,mg[i].j,mg[i].k);
         end;
     {********}
     count:=n-1;t:=1;
     fillchar(mg1,sizeof(mg1),0);mg1[1].rank:=1;
     Repeat
           For i:=1 to n-1 do
               begin
                    if (mg1[mg[i].i].rank=t) and (mg1[mg
[i].j].rank=0) then
                       begin
                            if mg1[mg[i].i].n1=0 then mg1[mg
[i].i].n1:=mg[i].j
                                                 else if mg1
[mg[i].i].n2=0 then mg1[mg[i].i].n2:=mg[i].j;
                            mg1[mg[i].j].app:=mg[i].k;
                            mg1[mg[i].j].rank:=t+1;dec
(count);
                       end;
                    if (mg1[mg[i].j].rank=t) and (mg1[mg
[i].i].rank=0) then
                       begin
                            if mg1[mg[i].j].n1=0 then mg1[mg
[i].j].n1:=mg[i].i
                                                 else if mg1
[mg[i].j].n2=0 then mg1[mg[i].i].n2:=mg[i].i;
                            mg1[mg[i].i].app:=mg[i].k;
                            mg1[mg[i].i].rank:=t+1;dec
(count);
                       end;
               end;
           inc(t);
     Until count=0;

End;

Procedure dynamic;
Var i,j,k,l,m:byte;temp:longint;
Begin
     fillchar(qhd,sizeof(qhd),0);
     For i:=t downto 1 do
         Begin
              For j:=1 to n do
                  if mg1[j].rank=i then
                  begin
                  if mg1[j].n1=0 then begin qhd[j,1]:=mg1
[j].app;qhd[j,0]:=1;end
                  else
                  begin
                       qhd[j,1]:=mg1[j].app;qhd[j,0]:=1;
                       if qhd[mg1[j].n1,0]>0 then For k:=1
to qhd[mg1[j].n1,0] do
                           begin
                                if qhd[j,k+1]<qhd[mg1
[j].n1,k]+mg1[j].app then qhd[j,k+1]:=qhd[mg1[j].n1,k]+mg1
[j].app;
                                if k+1>qhd[j,0] then qhd
[j,0]:=k+1;
                                if qhd[mg1[j].n2,0]>0 then
For l:=1 to qhd[mg1[j].n2,0] do
                                    begin
                                        if qhd[j,l+1]<qhd
[mg1[j].n2,l]+mg1[j].app then qhd[j,l+1]:=qhd[mg1[j].n2,l]
+mg1[j].app;
                                        if l+1>qhd[j,0]
then qhd[j,0]:=l+1;
                                        m:=k+l+1;
                                        if m>qhd[j,0] then
qhd[j,0]:=m;
                                        temp:=qhd[mg1
[j].n1,k]+qhd[mg1[j].n2,l]+mg1[j].app;
                                        if qhd[j,m]<temp
then qhd[j,m]:=temp;
                                    end;

                           end;
                       if qhd[j,0]>q-mg1[j].rank+2 then qhd
[j,0]:=q-mg1[j].rank+2;
                       if qhd[j,0]<0 then qhd[j,0]:=0;
                  end;
                  end;
         End;
End;

Begin
     readin;
     dynamic;
     writeln(qhd[1,q+1]);
End.

1) Tran Quang Khai
2) Tran Thanh Hoai
3) Nguyen Phuong Ngoc
4) Hoang Duc Viet Dung

 - Why the last line in output has 3 number?
 - What range of route ? 1..1000 ?
Thanks

71222119
mailto : trungduck@yahoo.com

Tuan roi khong vao chu da lam toi 101 bai roi :( .

Who are the members of it ?
71222119
mailto : trungduck@yahoo.com

Внимание решающим! В задаче неправильный пример входных
данных! Не смотрите на него, читайте спецификацию. В начале
идет количество, потом элементы. Из-за этого глюка я
посылал эту задачу 6 раз.

I sovle this problem by BFS
I think that right but I can't accept it .
It have anny traps ?
Thanks

I wrote a program in radix sort, it's simple, i think.
But always wa, could anybody give me some tips?
or some tricky cases?

mail me at blhuang@online.sh.cn, ok?
Thank u.

Because there are two ways to get accepted : The one is
brute force, and another is simply. The first one take us
more than 10s but the second just take less than 0.05s.
Yes, good Prob !
71222119
mailto : trungduck@yahoo.com

Ong su dung ID cua tui a ? Neu dung thi phai dung bai acc
chu sao lai dung bai WA (1050) ?

Ong su dung ID cua tui a ? Neu dung thi phai dung bai acc
chu sao lai dung bai WA (1050) ?