In article <[EMAIL PROTECTED]>,
[EMAIL PROTECTED] (Ton Hospel) writes:
> In article <[EMAIL PROTECTED]>,
> Mtv Europe <[EMAIL PROTECTED]> writes:
>> Hello!
>>
>> New day, new golf "Automatic Editing":
>>
>> http://209.237.255.144/~pgas/score.pl?func=rules&hole=42&season=1
>>
>
> Important missing testcase:
>
> {
> 'out' => 'cbbbbbbbbbbbbbbbbbbbbbaaaaaaaaaaaaaaaaaaaaa
> ',
> 'in' => 'ca
> aaaaaac
> cb
> bbbbbbc
> ab
> ba
> aaaaaac
> ca
> bbbbbbc
> cb
> caaaaaaaaaaaaaaaaaaaaabbbbbbbbbbbbbbbbbbbbb'
> },
>
>
> Also to be added: an edge testcase with everything at max:
> full length input string, all 10 transforms full length.
I guess I was being too subtle with that last sentence.
Several solution build a repeated s/// string, and then eval that.
leading to a 127*128*(2*80+5)=26822400 char string.
The rules guarantee you a "a few million" entries in a datastructure,
and 27 million is a lot more than that. In actuallity evalling such a
string uses bout 360M real memory on my perl, again clearly too much.
So i think a lot of solutions have to be rejected.
