|
|
Subject | Author | Problem | Updated | Answers |
---|
Solution without brute force | Oleksii Kavka | 1005. Stone Pile | 20 Jan 2016 11:40 | 2 | For those who have no idea, here is a tip | Jamil Siam | 1005. Stone Pile | 20 Nov 2015 16:58 | 0 | Can't resolve problem on ruby, Time Exceed Issue | Sergey Khvan | 1005. Stone Pile | 18 Nov 2015 22:13 | 1 | Test 5 Wrong Answer | Dmitriy | 1005. Stone Pile | 3 Oct 2015 08:24 | 4 | hints | 6ahodir | 1005. Stone Pile | 23 Jul 2015 11:42 | 7 | Just use brute force, it works. | gopher nice byte | 1005. Stone Pile | 12 Feb 2015 03:36 | 0 | Partition problem | Someone Else | 1005. Stone Pile | 24 Dec 2014 01:45 | 0 | Help Please, WA test 7 | Malarg | 1005. Stone Pile | 1 Dec 2014 01:58 | 1 | What is "mid in the middle" algorithm for solving this problem? | Squire [Lviv NU] | 1005. Stone Pile | 28 Aug 2014 04:53 | 3 | Pay attention to the situation that n=1,or you maybe WA on test#2 | WYKay | 1005. Stone Pile | 19 Jun 2014 06:44 | 1 | what algo to follow to solve this? hints please | Anupam Ghosh,Bengal Engg and Sc Uni,MtechIT,India | 1005. Stone Pile | 9 Nov 2013 18:50 | 18 | Brute force it | Marius Zilenas | 1005. Stone Pile | 16 Oct 2013 10:32 | 0 | Who solve this problem with DP, | ural_ghost | 1005. Stone Pile | 28 Sep 2013 19:10 | 7 | Brute Force after rejudge | TinyJanssen | 1005. Stone Pile | 11 Jun 2013 19:57 | 3 | WA( I not underdstand why) | ZiDo | 1005. Stone Pile | 22 May 2013 07:29 | 3 | Wrong letter in problem statement | candide | 1005. Stone Pile | 5 May 2013 19:26 | 0 | DP with O(n*max(wi)) time and O(max(n, max(wi))) space | Серовиков Андрей | 1005. Stone Pile | 30 Apr 2013 02:58 | 0 | WA #9 | YuriG | 1005. Stone Pile | 15 Apr 2013 15:10 | 1 | Problem 1005 Stone Pile has been rejudged | Vladimir Yakovlev (USU) | 1005. Stone Pile | 29 Mar 2013 01:04 | 0 | 1005 - stone pile | gogreen | 1005. Stone Pile | 25 Mar 2013 14:58 | 0 |
|
|
|