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

Discussion of Problem 1741. Communication Fiend

Show all threads     Hide all threads     Show all messages     Hide all messages
Help with DP solutionMatei Chirvasa1741. Communication Fiend26 Mar 2022 22:151  
wa3Fyodor Menshikov1741. Communication Fiend10 Jul 2018 23:042  
HintsGleb1741. Communication Fiend17 May 2018 19:341  
Heeeh) Wa8Rocky.B1741. Communication Fiend17 Dec 2016 20:131  
Using Short path algo seems feasibleBlackops1741. Communication Fiend10 Sep 2016 21:432  
Why WA#12?Accelarator1741. Communication Fiend4 Dec 2015 18:521  
W9FvckHer1741. Communication Fiend26 Aug 2015 12:382  
WA#10r1d11741. Communication Fiend15 Dec 2013 23:014  
Could ADMIN show the TEST#8?YSYMYTH1741. Communication Fiend12 Oct 2013 11:032  
WA#8kot1741. Communication Fiend30 Dec 2011 04:332  
Why WA1?evjava1741. Communication Fiend13 Oct 2011 18:402  
For WA#3 and Some hints how to solve the problem with O(n * log(n))Leonid (SLenik) Andrievskiy1741. Communication Fiend16 Aug 2011 00:594  
Бред!NickSergeev[MSU MindCraft]1741. Communication Fiend6 Aug 2011 21:456  
Why WA#8?Alexander Samal1741. Communication Fiend14 Apr 2010 13:418  
Weak testsunlucky [Vologda SPU]1741. Communication Fiend23 Nov 2009 01:4321  
CRACKEDliuexp1741. Communication Fiend2 Nov 2009 01:3910  
would it exceed int32?liuexp1741. Communication Fiend1 Nov 2009 15:402  

Style: flat | tree | nested
Thread Order: bubble | fixed