ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1307. Archiver

I suppose that my solution is correct. The output size is constant for the given length of input. So, there are only two possibilities:
 1. You compile output file not correctly.
 2. You test output on more slowly machine.

Thanks.
Dmitry 'Diman_YES' Kovalioff I think everything is correct. Try to explain your problem mory clearly (-) [2] // Problem 1307. Archiver 20 Jul 2004 12:45
Flyer Ok. I got WA Test 1. So, I don't know why :( [1] // Problem 1307. Archiver 20 Jul 2004 15:40
I use such algorithm. For each 8 symbols I generate 7 symbols in archive in following way: bits of last symbol I share in those 7 symbols (by adding/not adding the total count of accepted symbols). So I can't make archive larger than source. I see only two possibilities: or archive got CE, or it got TL. I can post my source.

Thanks.
Dmitry 'Diman_YES' Kovalioff Hm-m (+) // Problem 1307. Archiver 22 Jul 2004 15:24
The classical way to solve this (not very difficult) problem is to use LZW-compression. But your WA(1) seems to be interesting for me :) Post your source to dimanyes@mail.ru