>

> Please, help to me with the staircase - problem 1017
> It always gives mi "Acces Violation Crash". Why?
Maybe you generated a "Range Check Error" or something like
that.

> program Timus_1003;
> const
>   MaxQAs=5000;
>   EndFlag=-1;
> type
>   TQA=
>     record
>       First,Last:LongInt;
>       Answer:Boolean;
>     end;
> var
>   nQAs,X:LongInt;
>   QAs:array [1..MaxQAs] of TQA;
> function InputData:Boolean;
> var
>   i,Len:LongInt;
>   Temp:string;
> begin
>   ReadLn(Len);
>   if Len=EndFlag then
>     begin
>       InputData:=False;
>       Exit;
>     end;
>   ReadLn(nQAs);
>   for i:=1 to nQAs do
>     with QAs[i] do
>       begin
>         ReadLn(First,Last,Temp);
>         while Temp[1]=' ' do
>           Delete(Temp,1,1);
>         Answer:=Temp='odd';
>       end;
>   InputData:=True;
> end;
> procedure Solve;
> var
>   i,nItems:LongInt;
>   Items:array [1..MaxQAs] of TQA;
> function Insert(QA:TQA):Boolean;
> var
>   i,MaxLast,MinLast:LongInt;
>   MaxAnswer,MinAnswer:Boolean;
>   Item:TQA;
> function FindItem(First:LongInt):LongInt;
> var
>   i,j,k:LongInt;
> begin
>   i:=1;
>   j:=nItems;
>   repeat
>     k:=(i+j) div 2;
>     if Items[k].First=First then
>       begin
>         FindItem:=k;
>         Exit;
>       end
>     else
>       if Items[k].First>First then
>         j:=k-1
>       else
>         i:=k+1;
>   until i>j;
>   FindItem:=0;
> end;
> procedure InsertItem(Item:TQA);
> var
>   i,j:LongInt;
> begin
>   for i:=1 to nItems do
>     if Items[i].First>Item.First then
>       begin
>         for j:=nItems downto i do
>           Items[j+1]:=Items[j];
>         Inc(nItems);
>         Items[i]:=Item;
>         Exit;
>       end;
>   Inc(nItems);
>   Items[nItems]:=Item;
> end;
> function Subtract(A,B:Boolean):Boolean;
> begin
>   Subtract:=A xor B;
> end;
> begin
>   repeat
>     i:=FindItem(QA.First);
>     if i=0 then
>       begin
>         InsertItem(QA);
>         Insert:=True;
>         Exit;
>       end
>     else
>       if Items[i].Last=QA.Last then
>         begin
>           Insert:=Items[i].Answer=QA.Answer;
>           Exit;
>         end
>       else
>         begin
>           if Items[i].Last>QA.Last then
>             begin
>               MaxLast:=Items[i].Last;
>               MinLast:=QA.Last;
>               MaxAnswer:=Items[i].Answer;
>               MinAnswer:=QA.Answer;
>             end
>           else
>             begin
>               MaxLast:=QA.Last;
>               MinLast:=Items[i].Last;
>               MaxAnswer:=QA.Answer;
>               MinAnswer:=Items[i].Answer;
>             end;
>           with Items[i] do
>             begin
>               Last:=MinLast;
>               Answer:=MinAnswer;
>             end;
>           with Item do
>             begin
>               First:=MinLast+1;
>               Last:=MaxLast;
>               Answer:=Subtract(MaxAnswer,MinAnswer);
>             end;
>           QA:=Item;
>         end;
>   until False;
> end;
> begin
>   nItems:=0;
>   FillChar(Items,SizeOf(Items),0);
>   for i:=1 to nQAs do
>     if not Insert(QAs[i]) then
>       begin
>         X:=i-1;
>         Exit;
>       end;
>   X:=nQAs;
> end;
> procedure Print;
> begin
>   WriteLn(X:0);
> end;
> begin
>   while InputData do
>     begin
>       Solve;
>       Print;
>     end;
> end.
>

> Type Arr                        = record
>           X,Y                   : Integer;
>           P                     : Byte;
>           L                     : Integer;
>      End;
> Var N,L,M                       : Integer;
>     Land                        : Array[1..100] of Arr;
>     S1,S2                       : Array[1..200] of
Integer;
>     Total1,Total2               : Integer;
>
> Procedure Init;
> Var i,j : Integer;
> Begin
>   Readln(N,L);
>   Readln(M);
>   For i := 1 to M do
>     Readln(Land[i].P,Land[i].L,Land[i].X,Land[i].Y);
> End;
>
> Procedure Main;
> Var i,j,k : Integer;
>     T     : Arr;
>     T2    : Integer;
>     Max   : Byte;
>     Min   : Byte;
>     Yes   : Boolean;
> Begin
>   Min := 255;
>   For i := 1 to N-L do
>     For j := 1 to N-L do
>       Begin
>         Max := 0;
>         For k := 1 to M do
>           If (i+L<=Land[k].X) or (i>=Land[k].X+Land[k].L)
or
>              (j+L<=Land[k].Y) or (j>=Land[k].Y+Land[k].L)
> then Continue
>              else If Land[K].P>Max then
>                Begin
>                  Max := Land[K].P;
>                  If Max>Min then Break;
>                End;
>         If Max<Min then
>           Begin
>             Min := Max;
>           End;
>       End;
>   If Min<=100 then Writeln(Min)
>               else Writeln('IMPOSSIBLE');
> End;
>
> Begin
>   Init;
>   Main;
> End.

Just think a little ! This Prob is as easy as Prob 1000. It
has one important point.
71222119
mailto : trungduck@yahoo.com
>

>

> Noway, it is impossible :)))