| Subject | Author | Problem | Updated | Answers |
|---|
| How fast could recursion optimised? | 👾_challenger128_[PermSNRU] | 1298. Knight | 2 May 2022 12:12 | 1 |
| What's wrong with test #3? | [SESC USU] Komarov && Kantorov | 1298. Knight | 11 Jun 2018 21:54 | 4 |
| Chess problem...TLE on test #10!! how to make it faster????? | michel mizrahi | 1298. Knight | 13 Jan 2018 01:57 | 8 |
| Possible solution. | Mahilewets | 1298. Knight | 17 Jul 2017 01:28 | 0 |
| Hint | Bekzhan | 1298. Knight | 5 May 2014 11:39 | 1 |
| It's strange. My prog runs faster when n=8 than when n=7. | Maigo Akisame (maigoakisame@yahoo.com.cn) | 1298. Knight | 5 May 2014 11:22 | 1 |
| recursion? | [OSTU]Svetkin | 1298. Knight | 1 Apr 2014 18:16 | 8 |
| Hint | ASK | 1298. Knight | 20 Nov 2012 02:16 | 2 |
| Help me please | Roma Labish[Lviv NU] | 1298. Knight | 3 Oct 2011 20:33 | 1 |
| Забавно | Michail Yudin | 1298. Knight | 14 Jan 2009 18:21 | 0 |
| Funny... | CHIDEMYAN SERGEY | 1298. Knight | 31 Jul 2007 17:02 | 0 |
| LOOK | And IV | 1298. Knight | 10 Jul 2007 07:21 | 0 |
| WA#3! it's impossible , there is only 8 test and my program gives right results for all n | Alias (Alexander Prudaev) | 1298. Knight | 26 Mar 2007 22:57 | 3 |
| WA on test #9? I can't understand because 1<=n<=8 | Ras Misha [t4ce] | 1298. Knight | 5 Jan 2007 11:16 | 1 |
| I don't know why my solution CE (Compilation Error) | thuchoithoi | 1298. Knight | 10 Jun 2006 23:15 | 3 |
| what is a funny tests ! | MSU Teminator | 1298. Knight | 16 Jan 2006 20:40 | 1 |
| Please help!!! Why my code get Crash (ACCESS_VIOLATION) #4? | REM | 1298. Knight | 11 Jun 2005 16:55 | 7 |
