Search found 5 matches

by alexg
Tue May 09, 2006 4:26 pm
Forum: Volume 1 (100-199)
Topic: 188 - Perfect Hash
Replies: 9
Views: 5207

Quantris wrote:wrong, the problem assures 32-bit integer (unsigned, of course) is sufficient.
Works fine with signed 32-bit integers. There are a maximum of 5 letters in each word. 5 bits for each letter = a maximum of 25 bits required.
by alexg
Thu May 04, 2006 3:28 pm
Forum: Volume 3 (300-399)
Topic: 386 - Perfect Cubes
Replies: 53
Views: 7427

I got 0.018 by using a hash table. I'll leave you to work out how a hashtable could help in this situation.
by alexg
Wed Sep 08, 2004 11:18 pm
Forum: Volume 2 (200-299)
Topic: 291 - The House Of Santa Claus
Replies: 19
Views: 6971

Hey malf....edit your post and remove the answers.

It's no fun if you allow people to just cut and paste the answers...
by alexg
Wed Sep 08, 2004 11:29 am
Forum: Volume 8 (800-899)
Topic: 863 - Process Scheduling
Replies: 13
Views: 4065

Yep..that's what I thought. Oh well, I'll wait for clarification or someone to submit an accepted solution.
by alexg
Tue Sep 07, 2004 4:11 pm
Forum: Volume 8 (800-899)
Topic: 863 - Process Scheduling
Replies: 13
Views: 4065

863 - Process Scheduling

OK...finished my program but it always returns WA

I've tried making lots of test input but still can't find a problem.

Anyone else tried this and want to share some I/O?

Go to advanced search