| Subject | Author | Problem | Updated | Answers |
|---|
| Help with DP solution | Matei Chirvasa | 1741. Communication Fiend | 26 Mar 2022 22:15 | 0 |
| wa3 | Fyodor Menshikov | 1741. Communication Fiend | 10 Jul 2018 23:04 | 1 |
| Hints | Gleb | 1741. Communication Fiend | 17 May 2018 19:34 | 0 |
| Heeeh) Wa8 | Rocky.B | 1741. Communication Fiend | 17 Dec 2016 20:13 | 0 |
| Using Short path algo seems feasible | Blackops | 1741. Communication Fiend | 10 Sep 2016 21:43 | 1 |
| Why WA#12? | Accelarator | 1741. Communication Fiend | 4 Dec 2015 18:52 | 0 |
| W9 | FvckHer | 1741. Communication Fiend | 26 Aug 2015 12:38 | 1 |
| WA#10 | r1d1 | 1741. Communication Fiend | 15 Dec 2013 23:01 | 3 |
| Could ADMIN show the TEST#8? | YSYMYTH | 1741. Communication Fiend | 12 Oct 2013 11:03 | 1 |
| WA#8 | kot | 1741. Communication Fiend | 30 Dec 2011 04:33 | 1 |
| Why WA1? | evjava | 1741. Communication Fiend | 13 Oct 2011 18:40 | 1 |
| For WA#3 and Some hints how to solve the problem with O(n * log(n)) | Leonid (SLenik) Andrievskiy | 1741. Communication Fiend | 16 Aug 2011 00:59 | 3 |
| Бред! | NickSergeev[MSU MindCraft] | 1741. Communication Fiend | 6 Aug 2011 21:45 | 5 |
| Why WA#8? | Alexander Samal | 1741. Communication Fiend | 14 Apr 2010 13:41 | 7 |
Weak tests
[ Pages: 1, 2 ] | unlucky [Vologda SPU] | 1741. Communication Fiend | 23 Nov 2009 01:43 | 20 |
| CRACKED | liuexp | 1741. Communication Fiend | 2 Nov 2009 01:39 | 9 |
| would it exceed int32? | liuexp | 1741. Communication Fiend | 1 Nov 2009 15:40 | 1 |
