Magic words decrypter

[admin]

This puzzle follows up on Magic words, now the goal is to decrypt a mixed up message generated by the Magic words puzzle. Since the words are random, we will make use of a dictionary to determine the most likely correct word.

Go to puzzle

[random.johnnyh]

I'm having problems getting my program to pass any of the unit tests.
I have extensively tested my program, and I'm certain it implements the decryption process correctly.
The only problem I can think of now is that my output may have formatting errors: do ending newlines or newline styles ("\r\n" or "\n") mattter?

[admin]

We agree that the \r\n and spaces are not really relevant, so we relaxed the syntax checker, now it should be less sensitive to \r\n and spaces.
I see your solution is passing now.

[Петър Петров]

Hi!

I just submitted my first try for this puzzle and I get a fail with an error message: "YYour program didn't pass the test case given in the puzzle example". Does this mean that the program didn't pass any of the test cases or really the one that is in the example of the specification.
Before the submission I verified the solution and it says - verification succeeded.

Could you please take a look.
Thanks and kind regards!
P.

[admin]

Sorry, we updated the syntax check earlier and it takes time for the changes to mirror everywhere on the cloud. We manually forced the update and reran the submissions for this puzzle.

[Ritesh Kumar Gupta]

Hey admin ,my solution works fine for all the test cases but the judge shows Fail for all the unit test cases.....
I have made every possible effort and I challenges my solution is correct for every cases;
There is something wrong with the judge thats for sure .
In message file ,is the number of white spaces between the words is exactly one...
I even considerd white spaces b/w the words can be multiple
(ie . wlemoce to cdeor ctrhas werhe parremgmors utine)will give output (welcome to coder charts where programmers unite).
Even took the multiple line cases into account.
please check my submission..
http://codercharts.com/submission/34393
Everything is absolutely correct but its giving "fail" for all 6 test files,.

please response ....... I spent my entire day in this and most of the tym i faces same problem with codecharts...Top coder and codechef are million tyms bettter that this site

[NeoRea]

This puzzle is novice, but i think it is easier than magic words which is easy+.

[skirmish]

Hello

i have tested my program with /usr/share/dict/words and a long text generated with code from 'Magic Words' using a paragraph from web and the result is fine.

So, where is the problem in my code after uploaded to CoderCharts?
How can i see the results of your tests?

Text used from 'Magic Words' problem:

The number of points is determined by the distance between the original word and the mixed word, the larger the distance the higher the score.

Result from 'Magic Words':

the nbeumr of pntois is dtrneimeed by the dncatise bweteen the oainigrl wrod and the miexd wrod, the lraegr the dncatise the hehgir the sroce.

Result from 'Magic Words Decrypter' using /usr/share/dict/words:

the number fo piston is determined by het disenact between het original drow and het mixed drow, het larger het disenact het higher het corse.

I have checked and the result is correct for me. May be, i wrong understand the problem.

Regards

[hellocopter]

@skirmish: It doesn't seem to be explicitly stated in this problem, but in the previous problem, the first and last letter must never be moved. I think the same restriction applies here, too. That means that "the" cannot become "het", because the "t" must stay at the beginning and the "e" must stay at the end, for example.

[Петър Петров]

Hi!

Do we have to consider punctuation? If yes, do we leave it in the output message, or do we print only the words?

kind regards,
P.