Check out the brand new compression algorithm I've invented exclusively for this problem. Please don't tell anyone about it till I have protected my copyright.

Since it's not allowed to post AC code (and in this case, probably, even the output of AC code), I'll only post the first several lines of output:

Input:
For your informtaion: this algorithm works fine for this problem

Output:
//CPP
#include<iostream>
char b[4]="or";
char s[1<<18]="F$ your inf$mtaion: this alg$ithm w$ks fine f$ this problem>";
[..]

P.S. Make sure you keep the secret.

Edited by author 15.02.2006 08:36

That's not new algo. I guess many programmers used it successfully. But AC by only replacing "or" => '$' is almost amazing.

It's much more sophisticated, I'm telling you, that's my brand new algo!

-

http://www.math.cornell.edu/~mec/2003-2004/cryptography/subs/digraphs.html

This table says that most frequent digraph is 'th'.

Used above digraph 'or' 3 times less frequent.

Replacing ends of lines (CR LF) by 1 character is enough! The template for unpack program is only 160 bytes long including indentation and blank lines!

In what way can I change, for example "or"?
I'm new one in C++. Can you tell me?

I understood. But how to be with new lines?
I cann't write
string s="a
b";
with original
a
b

It's "a\nb"

Oh... I thought I could only use it with printf...

I think "a☺b" better:)

There is also such combination: ", ". Recommendation: use C++ for archive: here we can write string in one line. Delphi also compile such code, but free pascal (2.0.4) doesn't!