| ENG RUS | Timus Online Judge |
Common BoardDanis I don't undesrstand where is a mistake. Who can help? // Problem 1001. Reverse Root 6 Nov 2023 18:42 lines = [] for line in stdin: for i in range(0, len(line.split())): lines.append(line.split()[i]) lines = [int(i) for i in lines] lines_rev = list(reversed(lines)) numbers = [] for i in range(0, len(lines_rev)): numbers.append(lines_rev[i]**0.5) for i in range(len(numbers)): print(f"{numbers[i]:.4f}") andreyDagger`~ checker failed [1] // Problem 1859. Last Season of Team.GOV 1 Nov 2023 01:19 fix this plz Vladimir Yakovlev (USU) Re: checker failed // Problem 1859. Last Season of Team.GOV 6 Nov 2023 01:16 Fixed Arseny Babushkin (aytel)'` RE16 [1] // Problem 1587. Flying Pig 20 Aug 2016 14:27 I've got many RE16 with using python 3.4. Did anybody else get it? How did you solve it? Mortus Re: RE16 // Problem 1587. Flying Pig 6 Nov 2023 00:29 I don't know why , but I just stopped using division in my solution and got AC! eremeev.me.2012@gmail.com Ac Pythoh !!! // Problem 2056. Scholarship 5 Nov 2023 21:27 a = int(input()) f = [] for i in range(a): s = int(input()) f.append(s) if f.count(3) >=1: print('None') else: if f.count(5) == len(f): print('Named') elif sum(f) / len(f) >=4.5: print('High') else: print('Common') alennv Test 1 , WA [1] // Problem 2020. Traffic Jam in Flower Town 31 Oct 2023 19:29 Can anyone give tests data or some discription? Edited by author 01.11.2023 14:24 Sandro (USU) Re: Test 1 , WA // Problem 2020. Traffic Jam in Flower Town 5 Nov 2023 02:37 Test 1 is the first sample test from the problem statement. Mortus useful test // Problem 1940. Not So Simple Years 4 Nov 2023 02:12 1000000000 1000000000 300 answer: 97395891 Sergey Test for WA 21 // Problem 1888. Pilot Work Experience 30 Oct 2023 20:11 7 8 1 2 1 3 1 4 5 6 6 7 7 8 7 5 Amil Khare Better Understanding of states [1] // Problem 2018. The Debut Album 17 Sep 2017 14:26 Hello, I am trying this question, however, I am unable to understand how to construct the solution. My Dp is weak so I thought to practice here, however I am having a tough time. Can someone please help in describing how to start thinking about such problems? Kirusha Re: Better Understanding of states // Problem 2018. The Debut Album 30 Oct 2023 12:59 Good luck))) 👑TIMOFEY👑`~ WA3 // Problem 1592. Chinese Watches 30 Oct 2023 09:51 we have 12 hours on clocks Yury_Semenov WA10 // Problem 1678. Space Poker 3 28 Oct 2023 15:22 If you have WA10, make sure you don't have 'I' as a card value instead of 'T'. For some reason it was very easy for me to mix these letters in the statement... 👑TIMOFEY👑 how do it more simply [1] // Problem 1116. Piecewise Constant Function 31 Oct 2022 17:44 u can search for intersections instead of looking for cutouts, just invert the segments of the second function use min max instead of a lot of conditions and you get a very simple code :) bashNewbie Re: how do it more simply // Problem 1116. Piecewise Constant Function 27 Oct 2023 01:13 Simpler is to brute-force InstouT94 Does the greedy solution work? // Problem 1782. Jack's New Word 21 Oct 2023 16:50 My idea is to reverse the operations of adding characters and doubling a string. I have an iterative algorithm in O(n * log(n)). At each iteration, I count dp - the length of the maximum substring ending with index i, obtained by the doubling operation. Then I look for the maximum among the maximum substrings and truncate the current string to leave this substring. But this is a greedy solution. Is it possible to come up with a counterexample to it? юри пустовалив checker failed // Problem 1954. Five Palindromes 21 Oct 2023 01:29 admins, could you pls fix this? Mickkie Little Guide // Problem 2042. Nikita 21 Oct 2023 00:05 My first attempt use string hashing to check the palindrome with Segment Tree lazy prop. O(Q*K*logK*logN), esp. for the update query and it's TLE 11 However, using Manacher algorithm with Segment Tree you can achieve O(Q*(K+lgN)) Little help: - WA#3 : You're likely answering too much. (K involved) - WA#9 : N=10^5, overflow somewhere Delpher WA №16 [3] // Problem 1497. Cutting a Square 27 Apr 2011 14:41 Help! What is wrong? [code deleted] Edited by moderator 05.11.2023 02:38 Egor Re: WA №16 // Problem 1497. Cutting a Square 4 Mar 2013 15:22 maybe this test can halp you? 5 00000 01111 01111 01110 00000 Jane Soboleva (SumNU) Re: WA №16 [1] // Problem 1497. Cutting a Square 1 Oct 2015 15:36 I also had WA 16, turns out this was the reason: 5 11100 10000 00011 11000 00000 In this test, i assumed that you can move away parts with 1's, thus separating 0's from everything. But it turns out to be wrong, you're only allowed to move zeros, and ones stay fixed in place. bashNewbie Re: WA №16 // Problem 1497. Cutting a Square 20 Oct 2023 17:05 This is not a valid test Ahmet Помогите пожалуйста, разве это неверное решение (PascalABC) // Problem 1068. Sum 19 Oct 2023 22:38 var N: integer; begin readln(n); if (abs(n)>10000) then writeln('Îøèáêà ââîäà') else if N>=0 then writeln(((1+n)*n)/2) else writeln(((1+n)*(abs(n)+2))/2); end. Yura Почему не засчитывает?Why does not count?№1068.PascalABC [2] // Problem 1068. Sum 23 Dec 2016 10:30 var a: integer; b: real; begin readln(a); if (abs(a) < 10001) then begin if (a < 0) then b := (a + 1) * (-a + 2) / 2 else b := 0; if (a > 0) then b := (a + 1) * a / 2 else if (a < 0) then b := (a + 1) * (-a + 2) / 2 else b := 1; writeln(b); end; end. Oleg Baskakov Re: Почему не засчитывает?Why does not count?№1068.PascalABC [1] // Problem 1068. Sum 23 Dec 2016 17:22 Я так понимаю, ты используешь тип real для b, потому что / не работает. Следует помнить, что для целочисленного деления нужно использовать div, а не /. То есть, вариант 1 — заменить b: real на b: integer и все / на div. Вариант 2 — можно продолжать использовать /, но вместо writeln(b) следует написать writeln(b:0:0) (второе :0 — количество знаков после запятой для вывода). Также, проверки типа if (abs(a) < 10001) не нужны — если в задаче сказано о таком ограничении на входные данные, значит в тестах так честно и будет, и не нужно это проверять. Ahmet Re: Почему не засчитывает?Why does not count?№1068.PascalABC // Problem 1068. Sum 19 Oct 2023 22:35 А у меня тоже такая же проблема: var N: integer; begin readln(n); if (abs(n)>10000) then writeln('Îøèáêà ââîäà') else if N>=0 then writeln(((1+n)*n)/2) else writeln(((1+n)*(abs(n)+2))/2); end. IS that wrong answer? Mickkie Hint // Problem 2166. Two Roads 18 Oct 2023 18:15 Read article: convex hull of n*(n-1)/2 intersection points of n lines Implementation is very easy. But the proof is cool to read. Mortus WA 9 // Problem 1440. Training Schedule 17 Oct 2023 15:18 spell the months correctly alexxey WA 19 // Problem 1297. Palindrome 16 Oct 2023 00:23 try kookko ans: kook
|