| ENG RUS | Timus Online Judge |
Common Boardtdnnojtupbkmuhehvb Python 3 [1] // Problem 1243. Divorce of the Seven Dwarfs 12 Apr 2021 14:40 print(int(input())%7) Max Nest Re: Python 3 // Problem 1243. Divorce of the Seven Dwarfs 24 Aug 2021 11:19 The best solution zwqzwq O(1) // Problem 1716. Alternative Solution 23 Aug 2021 08:52 a is the number of NO ; b is the number of YES ans=a/n+(n-1)*(a/n)*(b/(n-1))+(n-1)*(b/n)*(a/(n-1)) =a/n+2ab/n =a*(1+2b)/n LaVuna [NULP] O(W*H) solution passes // Problem 1235. Cricket Field 22 Aug 2021 13:43 O(W*H) solution passes Edited by author 22.08.2021 13:50 Edited by author 22.08.2021 13:50 ilalex Странное условие [5] // Problem 1740. Deer is Better! 26 Apr 2013 09:39 "чтобы любой отрезок пути длиной k километров пробегать ровно за h часов." Если ЛЮБОЙ отрезок длины к он пробегает за h, то разве из этого не следует, что скорость постоянна? mberdyshev Re: Странное условие // Problem 1740. Deer is Better! 11 Oct 2017 00:02 Нет Mahilewets Nikita [BSUIR] Re: Странное условие // Problem 1740. Deer is Better! 11 Oct 2017 22:24 Ну бежал от 99% пути со скоростью света А оставшийся 1% пути пробежал с такой скоростью (очень медленно пробежал) , чтобы получить суммарное время h часов Gulliput Re: Странное условие [2] // Problem 1740. Deer is Better! 27 Sep 2018 01:21 Странность здесь в другом: какой может быть максимум времени, если не оговорены ограничения на траекторию поездки ?! Он ведь может кататься зигзагами, потерять в дороге паспорт и прочесывать тундру в его поисках, и т.п. Максимум равен бесконечности ! Edited by author 27.09.2018 01:21 Artem Re: Странное условие // Problem 1740. Deer is Better! 16 Mar 2019 19:49 возможно Gulliput Re: Странное условие // Problem 1740. Deer is Better! 22 Aug 2021 00:32 Полностью согласен. Условие задачи явно кривое. Daulet Для тех, кто не понял [3] // Problem 1740. Deer is Better! 4 Dec 2019 23:02 Скорость оленей не ограничена, т.е. они могут хоть телепортироваться считай Здесь факт лишь в том, что они должны пробежать за H часов K километров По этому минимальное например при данных 30 11 2 будет равно 4 Объясняю: За 4 часа олени пробегут 22 км (ну, 11*2 просто) , и так как осталось 8 км, то они могут это расстояние просто перелететь (телепортнуться), ведь это меньше 11 км, поэтому им и время не нужно (они же не прошли 11, значит и 2 часа не нужно). А с максимальным все очень просто, это просто время если бы олени двигались с постоянной скоростью, но могли немного перебежать нужное расстояние(главное чтобы оно было не больше к) При 30 11 2 макс время будет 6 часов, тк только тогда олени достигнут своих 30км изначальных (ну немного больше пробегут - 33 км) Надеюсь кому-то поможет в решение zxc master Re: Для тех, кто не понял [1] // Problem 1740. Deer is Better! 6 Dec 2020 02:44 Спасибо) SergMagpie Re: Для тех, кто не понял // Problem 1740. Deer is Better! 27 Dec 2020 14:05 The problem is just from Russia. Pay attention, the Chukchi is running, not an Eskimo, not an Indian, but a Chukchi. And in Russia everything is relative. And the position of the Chukchi is relative. That is, the Chukchi is located somewhere in the Yamal-Nenets district. On the territory within a radius of 100 kilometers from the telephone tower. In 2 hours he will be in an area within a radius of 100 kilometers from another telephone tower. That is, he will reach Moscow in 4 hours, plus or minus 2 hours. Something like this. Translation problems. Gulliput Re: Для тех, кто не понял // Problem 1740. Deer is Better! 22 Aug 2021 00:30 Что-то ваши объяснения не очень логичны. Вы уверены, что именно эта логика заложена авторами задачи ? Lemmiwinks if WA 4 [1] // Problem 1020. Rope 24 Jun 2021 20:22 use the formula sqrt(abs(x1 - x2)**2 + abs(y1 - y2)**2) not abs(x1 - x2) + abs(y1 - y2) Abu Bakor Siddik Re: if WA 4 // Problem 1020. Rope 20 Aug 2021 20:42 Thanks, man! farmer.26 WA2 // Problem 1590. Bacon’s Cipher 20 Aug 2021 16:26 Please give me some tests! Celebrate an easy method // Problem 1395. Pascal vs. C++. Version 2 20 Aug 2021 13:16 (Please forgive me for my poor English.) First,use Hash to record ai Then,enumerate i,j as the first and the second items in the arithmetic sequence.check if 2*a[i]-a[j] exists.If it exists,we stop it immediately because the arithmetic sequence has been found.Otherwise,we find the arithmetic as brute force and mark the longest arithmetic sequence. At last,it's easy to restore the arithmetic sequence. So we can solve it in O(n^2). Edited by author 20.08.2021 13:43 Михаил WA13 [1] // Problem 2141. Sasha Vilkin 30 Oct 2019 13:02 Give some tests, please Dmitri Belous Re: WA13 // Problem 2141. Sasha Vilkin 18 Aug 2021 14:56 I hope, the following will help. I've found it using a random generator and a brute force checker. 7 2 -5 -4 -1 -1 -5 5 Answer: 13 198808xc To admin: please fix the problem statement. [1] // Problem 1544. Classmates 3 11 Oct 2010 00:25 In this problem, all the operations should be done on the SAME computer, but I could NOT understand this from the statement, until I read the forum. This problem is quite easy: simple bruteforce could AC in short time, but I think this bug in statement have made this problem SEEMS hard (only 100+ ACed now). Please, fix it. Walker Re: To admin: please fix the problem statement. // Problem 1544. Classmates 3 18 Aug 2021 06:36 I think you can do on every computers.But doing on the same computer is the best solution. Maybe. Sorry my bad English.:) Furkat Ahrolov WA #38 // Problem 2102. Michael and Cryptography 15 Aug 2021 16:40 Не подскажете 38-тест? andreyDagger Stupid mistake // Problem 1348. Goat in the Garden 2 15 Aug 2021 11:04 Damn, i used min(xa, xb) <= x_h <= max(xa, xb) and got WA5, then I wrote min(xa, xb) <= x_h && x_h <= max(xa, xb) and got AC guilty spark Nice problem [1] // Problem 1037. Memory Management 11 Aug 2021 23:27 Similar to page scheduling. Used two sets to simulate the process. :) Brian Re: Nice problem // Problem 1037. Memory Management 14 Aug 2021 21:17 NICE VERY NICE guilty spark What is test 9? // Problem 1058. Chocolate 13 Aug 2021 17:35 Getting WA #9. My solution is bruteforce after dividing the lines Dembel {AESC USU} Help me! I got WA#3 [3] // Problem 1337. Bureaucracy 22 Oct 2006 12:04 give me some tests thanks. Dembel {AESC USU} Re: Help me! I got WA#3 [2] // Problem 1337. Bureaucracy 22 Oct 2006 12:12 INPUT 1 2 1 0 1 1 0 1 0 OUTPUT 0 is correct? AlexF [USTU] Re: Help me! I got WA#3 // Problem 1337. Bureaucracy 22 Oct 2006 20:41 My AC program says 0 is correct!) Walker Re: Help me! I got WA#3 // Problem 1337. Bureaucracy 13 Aug 2021 07:18 3Q,I got AC. LaVuna [NULP] Simple hint about solution. Make sure you spend at least 3 days on your solution, before seeing this. // Problem 1301. Cube in Labyrinth 13 Aug 2021 02:36 The problem can be solved using brute force solution andreyDagger SPOILER. Hint // Problem 1794. Masterpieces of World Architecture 12 Aug 2021 22:37 Make difference array, where dif[i] = i - a[i] Amon If you have WA or TLE on #8 // Problem 1156. Two Rounds 12 Aug 2021 16:40 Try 7 10 1 2 1 3 1 4 5 6 5 7 8 9 8 10 8 11 12 13 12 14 This test changed my solution totally. Hope it helps you:) LX&R Bacherikov a question [3] // Problem 1199. Mouse 30 Jul 2007 14:58 Can the mouse go under the furniture? I mean, can it's way cross the polygons? Chmel_Tolstiy Re: a question // Problem 1199. Mouse 30 Jul 2007 15:10 I didn't solve it. But I think mouse CAN'T cross the polygon. hedrok <ONPU> Re: a question // Problem 1199. Mouse 22 Sep 2009 14:51 If i think that mouse can go under furniture get WA3. If can't, get WA10 at the moment. So probably mouse can't go under furniture. Walker Re: a question // Problem 1199. Mouse 12 Aug 2021 06:42 I think it can't. I got WA3 if it can go under the furniture. But I got AC if it can't. Sorry,my English is very bad. andreyDagger Another approach // Problem 1134. Cards 11 Aug 2021 18:10 Actually, you can solve it as a graph problem, where numbers 0, 1, ..., n are vertices, which connected like: 0-1, 1-2, ...
|