Hi Lukas,
I've tested some available compressors. 7zip is the best compressors i'v ever seen.
http://sourceforge.net/projects/sevenzip
I tested some of its methods:
the best one is ``prmd''. It can greately compress. the final size is 21MB.
http://khorshid/~m.moghimi/enwik8prmd768.7z
We can work on compressing this file! it sounds better!
Are you to start working on the project?
I've tested some available compressors. 7zip is the best compressors i'v ever seen.
http://sourceforge.net/projects/sevenzip
I tested some of its methods:
the best one is ``prmd''. It can greately compress. the final size is 21MB.
http://khorshid/~m.moghimi/enwik8prmd768.7z
We can work on compressing this file! it sounds better!
Are you to start working on the project?
On 8/14/06, Lukas Ĺ alkauskas <
[EMAIL PROTECTED]> wrote:
Hi,
here is a task: http://prize.hutter1.net/
who want to help me to create an algo to solve task write me. We can create a little team and divide money.
--
You can contact me by :
msn messanger: [EMAIL PROTECTED]
yahoo messanger: [EMAIL PROTECTED]
Google Talk: [EMAIL PROTECTED]
Skype: halfas.online.now
IRC: HalFas` ( irc2.omnitel.net)
web: www.revidev.com
http://rvision.gamedev.lt/RVengine
--
-- Mohammad
do you C?!!
double m[] = { 9580842103863.650391, 133470973390.236450, 270};
int main(){m[2]--?m[0]*=4,m[1]*=5,main():printf(m);}
To define recursion, we must first define recursion!
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---