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 1005. Stone Pile

SubjectAuthorProblemUpdatedAnswers
Solution without brute forceOleksii Kavka1005. Stone Pile20 Jan 2016 11:402  
For those who have no idea, here is a tipJamil Siam1005. Stone Pile20 Nov 2015 16:580  
Can't resolve problem on ruby, Time Exceed IssueSergey Khvan1005. Stone Pile18 Nov 2015 22:131  
Test 5 Wrong AnswerDmitriy1005. Stone Pile3 Oct 2015 08:244  
hints6ahodir1005. Stone Pile23 Jul 2015 11:427  
Just use brute force, it works. gopher nice byte1005. Stone Pile12 Feb 2015 03:360  
Partition problemSomeone Else1005. Stone Pile24 Dec 2014 01:450  
Help Please, WA test 7Malarg1005. Stone Pile1 Dec 2014 01:581  
What is "mid in the middle" algorithm for solving this problem?Squire [Lviv NU]1005. Stone Pile28 Aug 2014 04:533  
Pay attention to the situation that n=1,or you maybe WA on test#2WYKay1005. Stone Pile19 Jun 2014 06:441  
what algo to follow to solve this? hints pleaseAnupam Ghosh,Bengal Engg and Sc Uni,MtechIT,India1005. Stone Pile9 Nov 2013 18:5018  
Brute force itMarius Zilenas1005. Stone Pile16 Oct 2013 10:320  
Who solve this problem with DP, ural_ghost1005. Stone Pile28 Sep 2013 19:107  
Brute Force after rejudgeTinyJanssen1005. Stone Pile11 Jun 2013 19:573  
WA( I not underdstand why)ZiDo1005. Stone Pile22 May 2013 07:293  
Wrong letter in problem statementcandide1005. Stone Pile5 May 2013 19:260  
DP with O(n*max(wi)) time and O(max(n, max(wi))) spaceСеровиков Андрей1005. Stone Pile30 Apr 2013 02:580  
WA #9YuriG1005. Stone Pile15 Apr 2013 15:101  
Problem 1005 Stone Pile has been rejudgedVladimir Yakovlev (USU)1005. Stone Pile29 Mar 2013 01:040  
1005 - stone pilegogreen1005. Stone Pile25 Mar 2013 14:580  

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