| ENG RUS | Timus Online Judge |
Общий форумMapu tests ;) [1] // Задача 1931. Отличная команда 14 фев 2019 11:43 5 5 4 3 2 1 (2) 1 1 (1) 10 3 3 4 2 5 6 1 9 9 3 (4) Rodion Re: tests ;) // Задача 1931. Отличная команда 5 авг 2020 20:10 wrong answer on 1st test obmanul suka Olerinskiy output format hint (wa1) // Задача 1160. Network 5 авг 2020 18:01 you should output edges in input order CatGirl Why Run Time error? 1WA Python [2] // Задача 1877. Велосипедные коды 8 апр 2020 21:32 a,b = map(int,input().split()) if (a % 2 == 0 and b % 2 != 0): print("yes") else: print("no") Rodion Re: Why Run Time error? 1WA Python [1] // Задача 1877. Велосипедные коды 5 авг 2020 17:53 because data type should be string, not integer Rodion Re: Why Run Time error? 1WA Python // Задача 1877. Велосипедные коды 5 авг 2020 17:56 sorry, my bad. data type is correct, but you should input like that: a=int(input()) b=int(input()) KostyaRychkov WA8: hint // Задача 2034. Корованы 3 авг 2020 17:58 Check that you use only shortest routes. I don't have any tests, but when I started checking this, then I got ACC. Михаил Wa3 // Задача 1121. Филиалы 3 авг 2020 14:43 Таким образом, если для данного перекрёстка нет подразделений СКБ Контур находящихся ближе, чем в 6 кварталах, то мы обозначим его числом 0. Carefully read this part of text. KostyaRychkov If you have RE5 // Задача 1860. Фибориалы 1 авг 2020 01:05 Try n = 100000 and remember that 1e6 * 1e6 > 2e9. KostyaRychkov This problem is simpler than the rating he has )) // Задача 1091. Тмутараканские экзамены 31 июл 2020 21:31 The most important thing is that you shouldn't keep finding sets when you've already found 10,000. Then you can optimize a little simple search and you get ACC. Good luck! Berdnikov Sergey INPUT [1] // Задача 1242. Оборотень 26 янв 2017 04:10 To enter variables correctly is more difficult then solve this problem. I think, it isn't very good idea to issue input like this. Виктор Re: INPUT // Задача 1242. Оборотень 31 июл 2020 21:16 agree mr.erfan What is test 5? // Задача 1930. Машина инженера Ивана 31 июл 2020 21:05 please help me. i have some problems in test 5. please help me! Pooya Very Simple Only a DFS!! [9] // Задача 1039. Юбилейная вечеринка 16 фев 2003 18:46 Locomotive Can you tell me how only with a DFS, Dear Pooya? // Задача 1039. Юбилейная вечеринка 17 фев 2003 00:13 > Fu Jieyun Re: Very Simple Only a DFS!! // Задача 1039. Юбилейная вечеринка 21 июн 2003 10:55 > Really? Without a TLE? Maigo Akisame Why not BFS? [4] // Задача 1039. Юбилейная вечеринка 10 июн 2004 04:07 w4ppsxy Re: Why not BFS? [3] // Задача 1039. Юбилейная вечеринка 17 июл 2007 12:37 my DFS is TLE does DFS don't TLE? can someone give me some help? lonelycorn Re: Why not BFS? // Задача 1039. Юбилейная вечеринка 27 дек 2007 20:46 ppsxy you should write DP of course. what's more my program doesn't TLE.Instead it WAs on #12 onealdc04 Why DFS? [1] // Задача 1039. Юбилейная вечеринка 26 фев 2010 01:14 What is TLE? hdya_backfire Re: Why DFS? // Задача 1039. Юбилейная вечеринка 18 окт 2012 11:38 Time Limit Exceeded alakiacc Re: Very Simple Only a DFS!! [1] // Задача 1039. Юбилейная вечеринка 23 янв 2015 03:29 ترو خدا؟؟؟ mr.erfan Re: Very Simple Only a DFS!! // Задача 1039. Юбилейная вечеринка 31 июл 2020 13:58 ناموسا ایرانی هستی؟ ای کلک Sai Teja Chokkarapu Easy Approach HINT // Задача 1353. Миллиардная Функция Васи 31 июл 2020 12:42 -> think of doing this problem first -> count of n digits numbers whose sum is equal to x. ->First try to think for smaller numbers less than 1000 i.e from 1 to 999. -> Create the tree for the same i.e numbers less than 999. -> after finding f(n,sum)(n is the number of digits and sum is the required sum). -> you can find f(9,sum)for all numbers less than 1000000000. -> now finally you need to handle for one number 1000000000. Cheers Edited by author 31.07.2020 12:43 Ivan #WA 3 [1] // Задача 2148. Безумный выстрел 28 июн 2020 20:06 I calculated two points of intersection from line that go through two points((x_mid, y_mid) and (x_circle,y_circle)) and then picked nearest two given two points.But this gives me WA3. What should i do? Kairom `Ekexity 💻 Re: #WA 3 // Задача 2148. Безумный выстрел 30 июл 2020 14:25 You need to check the possibility of a shot. The enemy may be out of your sight. kostan3 Rating 29 июл 2020 23:41 Is it possible to return my profile to the rating and under what conditions? Edited by author 04.08.2020 00:40 CNEinstein I don't under the meaning of this problem.Could somebody explain? [4] // Задача 1261. Чаевые 17 апр 2004 20:36 Vesper Re: I don't under the meaning of this problem.Could somebody explain? [3] // Задача 1261. Чаевые 21 апр 2004 17:46 A programmer has a set of banknotes valued 1, 3, 9 ..., 3^k,... one each. He has to pay N in a restaurant (provided) He must pay that much M so: M can be paid with banknotes the programmer has, i.e. he cannot pay 5, because he does not have 2 bank notes with value of 1; and M-N must be represented the same way, i.e. if N is 4, M cannot be 9, because 5 cannot be represented as a sum of 3^K, one or less for each K. So if asked 4, a programmer must pay 13, 13=9+3+1, 13-4=9. I hope you will understand this clumsy explanation. CNEinstein Thanks you for your help! I got AC. // Задача 1261. Чаевые 21 апр 2004 21:34 Edric Mao Re: I don't under the meaning of this problem.Could somebody explain? // Задача 1261. Чаевые 25 окт 2011 19:49 Thanks for the explanation. Ahmmed Jubayer Rumman Re: I don't under the meaning of this problem.Could somebody explain? // Задача 1261. Чаевые 28 июл 2020 19:57 here 4 can be represented as 1+3^1 . why i have to pay 13 ? I failed to understand the problem ? rayhan28 Step to solve this // Задача 1079. Максимум 26 июл 2020 04:49 1.declare an array.size 1000000 2.genarate all number according the problem description. 3.input the value n. 4.declare a container and take the value of the array .vector<int>v(a,a+n); 5.sort the container. 5.at last print v[n]; Edited by author 26.07.2020 04:57 Edited by author 26.07.2020 04:58 LaVuna [NULP] TLE #17 - Hint // Задача 1846. НОД 2010 25 июл 2020 14:27 If you have TLE on 17-th test , try to use clang compiler. For me it worked)) Vladimir Plyashkun [USU] Test for WA5 [1] // Задача 1930. Машина инженера Ивана 23 янв 2014 21:48 try this: 3 2 1 3 2 3 1 2 answear: 1 capitan.ARA.code Re: Test for WA5 // Задача 1930. Машина инженера Ивана 24 июл 2020 17:15 You realy snooze a lot my code have wrong in test5 and the ansear this test is correct:( Please do not waste the rest of your time Edited by author 25.07.2020 15:37 Edited by author 25.07.2020 15:37 Михаил TLE18? // Задача 2062. Амбициозный эксперимент 23 июл 2020 19:51 Alex Tolstov (Vologda STU) How do you solve this problem? [1] // Задача 1670. Звёздочка 18 ноя 2009 16:51 👨💻Stepavly👨💻 [ITMO] Re: How do you solve this problem? // Задача 1670. Звёздочка 23 июл 2020 04:12 Let's construct the resulting sequence from N to 1 by keeping merged segments in stack. What is the condition for merging two segments? They are touching by one of the sides (r_1+1=l_2 or r_2+1=l_1). The last part of the solution is trivial (make a tree of merges, ...). Namjmus Sakib Rashid solve by bitmask // Задача 1005. Куча камней 22 июл 2020 19:32 I think this tutorial will be helpful. [video language is Bengali] https://www.youtube.com/watch?v=MiltLqpzOsE Edited by author 22.07.2020 19:38
|