OJ Board

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.

I got 0.018 by using a hash table. I'll leave you to work out how a hashtable could help in this situation.

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

It's no fun if you allow people to just cut and paste the answers...

Yep..that's what I thought. Oh well, I'll wait for clarification or someone to submit an accepted solution.

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?