OJ Board

oh thanx.
Now I got accepted
I followed my logic with no changes, but I implemented long numbers in a different way.

<spoiler>

the long number is represented as an array of 3 longs, which is sufficient for this problem

</spoiler>

Oh, and by the way, is this i/o correct: ?

Hi folks. During the latest contest I tried to solve this problem, and even came up with an idea. But unfortunately after implementation, I have realized that fuctions with long numbers are required to solve this problem, as the answer will be too large even for unsigned long long. But when I implem...

mf, man, I thank you so much, with your smart hashing it's accepted even in Pascal
You r truly a guru like it's written below your avatar.

HDIV is your hash map size, right? okay, thanks for the info! I will try to implement it this way..
by the way, should I use STL string or just character arrays if I decide to write in C++?

Hey again. I have implemented hashing, but it doesn't solve my problem - I keep getting TLE (there are 13 of them already)... I am in complete despair... Here is how I do hashing: function getHash (const s: str16): longint; begin getHash := 0; tt := 1; //1, 26, 26^2, 26^3, ..., 26^16 for tti:=1 to l...

and how should an efficient hashing function look like? I have idea only about one which takes many gigabytes of memory...

Will it then pass the time limit?

just laid in bed a little and thought of an improvement. I can use hashing to check if the word is in dictionary within O(1) time, and not within O(log 25000) time. But to hash a string of lowercase chars of length 16, we need 43608742899428874059776 bits of memory, and this is too much. Of course i...

Hey, is there any way to solve this problem with my approach? I get TLE. And my method is as following: read all words from dictionary for each word make all transformations (848 transformations totally for remove, add and insert character, I think) and for each transformed word make a binary search...

I thank you, mf. Hope some day I will be able to help you too
By the way, is it possible to solve this problem without sorting?

mf , I thank you so much for your quick reply. Now it is clear.. But.. Did you start thinking from that point with "optimal solution" and "exchanging two adjacent jobs in optimal solution"? Because I am still pretty unsure about how to come to these thoughts, though I understand...

Hi guys!
I understand the method of solving this problem: sorting by ratio.
But I have global question: why it works?..

oh, and also a question. for example if we have line of input like this: __crhhi___ (where "_" stands for usual space) should we output: __hello___ or just hello thank you!! or if you don't want to waste your time on explaining to me, you can send your working .exe or maybe source code to ...

Hey! I really don't understand the reason of my WRONG ANSWER... I coded my solution both in C++ and Pascal and it fails at ~0.110 sec. My solution is backtracking with optimizations. It passes the big test from Waterloo within 1 second, so it is time-efficient. I think the reason is in empty-lines h...