These are my codes for the problem Compression Algorithm of ACM ICPC 2018 online round.
I don't understand what is the problem with the first solution.
Note: The expected precision was 10^-6.
Image 1
Image 2
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3885 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3580 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3506 |
| 7 | ecnerwala | 3505 |
| 8 | Radewoosh | 3457 |
| 9 | Kevin114514 | 3377 |
| 10 | gamegame | 3374 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 170 |
| 2 | Um_nik | 162 |
| 3 | -is-this-fft- | 161 |
| 3 | atcoder_official | 161 |
| 5 | djm03178 | 157 |
| 6 | Dominater069 | 156 |
| 7 | maomao90 | 155 |
| 8 | adamant | 154 |
| 9 | luogu_official | 153 |
| 10 | awoo | 152 |
→ Find user
→ Recent actions
Please explain the difference between the two solutions ACM ICPC 2018 online round
Revision en3, by rishi_07, 2017-11-05 22:09:57
History
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jan/01/2025 01:52:29 (i1).
Desktop version, switch to mobile version.
Supported by
