OJ Board

Thanks for answer!

I'm trying to solve this problem with Pascal.
Would you please tell me how to create a dynamic arrays using Pascal?

And what 'bout formula's maximum length?

Is there are any limitations in this problem?
1. Maximum length of a formula string?
2. Maximum number of formulas? (26^3*999?)

What a real range of the value's matrix?
Is it really 18278x999? If it is, what 'bout memory limitations?

Just integer values: 18278*1000*4 bytes ~= 73 Mb . Too much ...

Follows program gets WA! But why?
Maybe because of recursion? Too deep?
All my tests is working well... Help me please!

[pascal]program task112;
var
num,p,deep : integer;
ch : char;
ans,sign,a1,a2 : boolean;

function find(top:integer) : boolean;
var
root: integer;
begin
root:=0;
sign:=false ...

Wow! Thanks... Really, it isn't so easy!!!

Some topics of this board is talking about DP in this problem.
But what's wrong with this simple algorithm?
It's working well with all my tests...

[pascal]program task562;
var
P,N,i,j,t : integer;
l,r : longint;
a : array[1..101] of integer;
begin
readln(P);
while P>0 do begin
dec(P ...