Re: $100 Contest Question
On 3 Mar 2002, at 13:44, Robert Craig wrote:
<snippage happened>
> > What are the valid match characters for Contest#2? A-Z and a-z?
> > What about hyphens, and apostrophes?
>
> As Derek suggested,
> if a '-' or '\'' is supplied (or some character greater than ASCII 32),
> it should be treated as a literal character to be matched. Values
> from 0 to 32 represent "meta" characters, or placeholders for
> unspecified characters in the pattern. I'll only give you upper case
> literal characters, A, B, C, ...
So the input file will be all upper()'d already?
> On problem #3 you can use any dictionary, formatted
> any way you like, but I think Junko's is quite reasonable.
>
> Martin Stachon writes (privately):
> > After the load of the wordlist, how many times you will
> > call the function?
>
> In problem #2, assume that I will make 1000
> calls to your function.
You realise, at 5 minutes runtime per iteration, that's 83 hours? If you get
100 such entries, that's 345 DAYS of runtime for testing problem #2
programs.
> Derek Parnell writes:
> > On a similar point I made the assumption that a pattern of {4,6,9} is
> > equivalent to {1,2,3}. In other words, the actual value of the pattern
> > characters is not important, only that they represent a unique character in
> > the target word(s).
>
> Yes, that's correct.
>
> Aku writes:
> > (Problem #1) How is the time calculated?
> > How many iteration (loops) will it be tested?
>
> I'm planning to run each program once,
> with a few megabytes of input text.
*megabytes*? of the same few sentences repeated ad naseum, with different
keys? Or will you be feeding it a online book text with unique sentences and
the same key for all sentences?
Kat
|
Not Categorized, Please Help
|
|
