| Show all threads Hide all threads Show all messages Hide all messages |
| Problem 1306 "Sequence Median" has been rejudged (+) | Sandro (USU) | 1306. Sequence Median | 27 Mar 2016 12:27 | 1 |
New tests were added. About 160 solutions got WA verdict on them. |
| WA #1 | João Pedro Franco | 1837. Isenbaev's Number | 27 Mar 2016 05:57 | 1 |
WA #1 João Pedro Franco 27 Mar 2016 05:57 Why? My solution is ok when i run with other tests that i have seen in this forum, but when i submit here, i get WA#1! Is there a problem about the output? Thanks. |
| Тест №8. Какой должен быть ответ? | Ananstasya | 1083. Factorials!!! | 27 Mar 2016 02:17 | 2 |
Тест №8. Какой должен быть ответ? Ни у кого нет тестов (кроме тех, кто создавал задачи и соответственно тесты). Мы можем только догадываться какой может быть тест № а , если смотреть на каком тесте валится наш код. В общем методом подбора |
| Why Compilation error? | vladi | 1025. Democracy in Danger | 27 Mar 2016 00:53 | 2 |
var t: real; n, k, i,j: integer; a:array [1..101] of integer; begin readln(n); for i := 1 to n do begin read(a[i]); end; for i:=1 to n do begin for j:=1 to n do begin if a[i]<a[j] then begin swap(a[i],a[j]); end; end; end;
for i:=1 to (n div 2)+1 do begin t:=t+((a[i] div 2)+1); end;
write(t); end. Pascal hasn't function swap. You should to write it yourself |
| AC | vtalgo16_vgubarev | 1438. Time Limit Exceeded | 26 Mar 2016 17:18 | 3 |
AC vtalgo16_vgubarev 9 Mar 2016 23:39 What was pretty interesting problem. Ty Edited by author 26.03.2016 17:18 If you have problems with test 10, ensure that you determine command type correctly. For instance: ifi = 10 printer = 20 gotoend = ifi + printer print gotoend Re: AC vtalgo16_vgubarev 26 Mar 2016 17:18 Tokenization with finite state machine Edited by author 26.03.2016 17:19 |
| Getting WA#2. Anybody got the test case? | szawinis | 1353. Milliard Vasya's Function | 26 Mar 2016 14:35 | 2 |
Hint: consider what allowed for first digit |
| Where is the error ?? 9 test fails . Pascal . Где ошибка?? 9 тест не проходит. Паскаль. | Andriy | 1636. Penalty Time | 26 Mar 2016 02:41 | 3 |
var t1,t2,i,k,q:integer; a:array [1..10000000] of integer; begin read(t1,t2); for i:=1 to 10 do read(a[i]); for i:=1 to 10 do begin if a[i]>0 then k:=k+a[i]; end; if t1<t2 then begin q:=(k*20)+t1; if q<=t2 then write('No chance.') else if q>t2 then write('Dirty debug :('); end else if t1>=t2 then begin write('No chance.'); end; end. Edited by author 01.11.2014 13:12 Edited by author 01.11.2014 13:12 Why SUCH BIG MASSIVE if 10 elements will be used What is "k" initial value? |
| Where a mistake? | Eugene | 1472. Martian Army | 25 Mar 2016 21:04 | 1 |
In example we have: 7 soldiers 1 - commander 2 - Ki = 1, Ci = 10 3 - Ki = 2, Ci = 5 4 - Ki = 2, Ci = 3 5 - Ki = 3, Ci = 1 6 - Ki = 4, Ci = 2 7 - Ki = 5, Ci = 3 It's right? Now, by a problem A1 === 1, A5 = A6 = A7 === 0. A2, A3 and A4 - may be either 0 or 1, yes? if A2 = 1 and A3 = 0 and A4 = 1 then profit = C7 * |A7 - A3| + C6 * |A6 - A3| + C5 * |A5 - A3| + C4 * |A4 - A2| + C3 * |A3 - A2| + C2 * |A2 - 1| = 3 * 0 + 2 * 0 + 1 * 0 + 3 * 0 + 5 * 1 + 10 * 0 = 5 Then answer min profit = 5. But in example is 8.00 I understood! 4 - it's soldier too and his A4 === 0 too Edited by author 25.03.2016 21:20 |
| Hahaha | IlushaMax | 1636. Penalty Time | 25 Mar 2016 21:02 | 1 |
Hahaha IlushaMax 25 Mar 2016 21:02 |
| WOW! AC 0.296, 237 KB O(n^4) works! Can U describe me O(n^3) solution? | exwRabbits_AlMag(VNTU) | 1146. Maximum Sum | 25 Mar 2016 19:13 | 6 |
I cann't believe it! Dynamika O(n^4). Can you give me some hints about algo O(n^3)? Is it Dynamika too? Thanks a lot! Edited by author 04.06.2006 14:57 So, your solution O(N^4) was accepted? I know O(N^4), and O(N^3) (but it requires O(N^3) memory). I can tell you the last. So, what's the O(n^3) solution ? Hint: Solve problem 1296 first. And use it's solution. Hint: Solve problem 1296 first. And use it's solution. Yeah... That's right. Thanks a lot for the hint.... It worked. |
| Я правильно понял условие? От нас ведь этого ждут? | Alexandr | 1149. Sinus Dances | 25 Mar 2016 13:33 | 3 |
Программа почему-то постоянно дает сбой на 2-ом тесте, но так как явные ошибки в коде не обнаружены, может просто я не понял условие? 0 1 sin(1)+1 2 (sin(1)+2)sin(1-sin(2))+1 3 ((sin(1)+3)sin(1-sin(2))+2)sin(1-sin(2+sin(3)))+1 4 (((sin(1)+4)sin(1-sin(2))+3)sin(1-sin(2+sin(3)))+2)sin(1-sin(2+sin(3-sin(4))))+1 5 ((((sin(1)+5)sin(1-sin(2))+4)sin(1-sin(2+sin(3)))+3)sin(1-sin(2+sin(3-sin(4))))+2)sin(1-sin(2+sin(3-sin(4+sin(5)))))+1 6 (((((sin(1)+6)sin(1-sin(2))+5)sin(1-sin(2+sin(3)))+4)sin(1-sin(2+sin(3-sin(4))))+3)sin(1-sin(2+sin(3-sin(4+sin(5)))))+2)sin(1-sin(2+sin(3-sin(4+sin(5-sin(6))))))+1 7 ((((((sin(1)+7)sin(1-sin(2))+6)sin(1-sin(2+sin(3)))+5)sin(1-sin(2+sin(3-sin(4))))+4)sin(1-sin(2+sin(3-sin(4+sin(5)))))+3)sin(1-sin(2+sin(3-sin(4+sin(5-sin(6))))))+2)sin(1-sin(2+sin(3-sin(4+sin(5-sin(6+sin(7)))))))+1 8 (((((((sin(1)+8)sin(1-sin(2))+7)sin(1-sin(2+sin(3)))+6)sin(1-sin(2+sin(3-sin(4))))+5)sin(1-sin(2+sin(3-sin(4+sin(5)))))+4)sin(1-sin(2+sin(3-sin(4+sin(5-sin(6))))))+3)sin(1-sin(2+sin(3-sin(4+sin(5-sin(6+sin(7)))))))+2)sin(1-sin(2+sin(3-sin(4+sin(5-sin(6+sin(7-sin(8))))))))+1 9 ((((((((sin(1)+9)sin(1-sin(2))+8)sin(1-sin(2+sin(3)))+7)sin(1-sin(2+sin(3-sin(4))))+6)sin(1-sin(2+sin(3-sin(4+sin(5)))))+5)sin(1-sin(2+sin(3-sin(4+sin(5-sin(6))))))+4)sin(1-sin(2+sin(3-sin(4+sin(5-sin(6+sin(7)))))))+3)sin(1-sin(2+sin(3-sin(4+sin(5-sin(6+sin(7-sin(8))))))))+2)sin(1-sin(2+sin(3-sin(4+sin(5-sin(6+sin(7-sin(8+sin(9)))))))))+1 10 (((((((((sin(1)+10)sin(1-sin(2))+9)sin(1-sin(2+sin(3)))+8)sin(1-sin(2+sin(3-sin(4))))+7)sin(1-sin(2+sin(3-sin(4+sin(5)))))+6)sin(1-sin(2+sin(3-sin(4+sin(5-sin(6))))))+5)sin(1-sin(2+sin(3-sin(4+sin(5-sin(6+sin(7)))))))+4)sin(1-sin(2+sin(3-sin(4+sin(5-sin(6+sin(7-sin(8))))))))+3)sin(1-sin(2+sin(3-sin(4+sin(5-sin(6+sin(7-sin(8+sin(9)))))))))+2)sin(1-sin(2+sin(3-sin(4+sin(5-sin(6+sin(7-sin(8+sin(9-sin(10))))))))))+1 Блин. Все понял. Очень, очень и еще раз очень глупая ошибка. Edited by author 03.02.2016 00:55 |
| HELP!!! | SanaKomissarova | 1910. Titan Ruins: Hidden Entrance | 25 Mar 2016 10:40 | 1 |
HELP!!! SanaKomissarova 25 Mar 2016 10:40 |
| wa4 is feb (+) | ASK | 1201. Which Day Is It? | 25 Mar 2016 03:53 | 4 |
7 2 2000 mon......[.7]..14...21...28 tue...1....8...15...22...29 wed...2....9...16...23..... thu...3...10...17...24..... fri...4...11...18...25..... sat...5...12...19...26..... sun...6...13...20...27..... btw, to turn ' ' into '.', one can use sed 's/ /./g' You is good man! Thank you! Edited by author 02.09.2011 04:30 i have one to one answer, but anyway WA4, and only from C++, C# is fine... Oh... my bad, for 17 2 2000 was wrong by 1 symbol |
| WA 25 | Mahathir Ahmad | 1580. Dean's Debts | 24 Mar 2016 16:38 | 1 |
WA 25 Mahathir Ahmad 24 Mar 2016 16:38 I am getting WA 25. Can anybody give me some test case? |
| F. British scientists save the world | cplayer | 1925. British Scientists Save the World | 24 Mar 2016 02:00 | 8 |
Why the 2nd sample's answer is Big Bang? But why realy? I cant understand and could you please explain the first test too? Because the expected sum is 4+3-2*2(sum of the numbers shown on the screen+k-(n+1)*2) while the real sum is 6+x(the sum of the inputed numbers+the number YOU have to input), but they have to be equal: 4+3-2*2=6+x 7-4=6+x x=-3, but the answer is non-negative, so it is "Big Bang!". (in first sample you have 3+3+5+6+5+7+5-7*2 as the expected sum, and 1+1+3+5+5+2+x as the real sum: 3+3+5+6+5+7+5-7*2=1+1+3+5+5+2+x 34-14=17+x x=20-17 x=3 ) X is the output number. Or at least that is how i understood this problem. edit: what is the limit of X??? Edited by author 27.10.2012 15:43 You answer is kick ass. How can you figure out something like that? I check again and again, and it seems gibberish to me. I don't understand (n+1)*2. Can you tell me Why do you subtract (n+1)*2; Cause we subtracted 2 n+1 times |
| For coders who got Runtime Error | IlushaMax | 1496. Spammer | 24 Mar 2016 00:56 | 1 |
Just read it Runtime error. Программа аварийно завершила работу. Возможные причины: ненулевой код возврата (ошибка «non-zero exit code»); деление на ноль (ошибка «division by zero»); бесконечная рекурсия (ошибка «stack overflow»); недостаточный размер массивов или обращение по недоступному адресу в памяти (ошибка «access violation»). Чтобы избежать переполнения стека, используйте специальные директивы, которые приведены в разделах, посвященных конкретным языкам программирования. I've read and understood where my mistake is. Edited by author 24.03.2016 00:57 |
| Strange Testcases. Please Help! | Dev_Java | 1607. Taxi | 23 Mar 2016 10:53 | 3 |
for 150 400 1000 200: 150 1000 550 800* 950 600 how is the answer 800 and not 950 ?? for 100 100 150 20: 100 150* 200 130 why is the answer 150 and not 200 ?? for 1 2 12 3: 1 12 3 9 5 6* 7 5 why is the answer 6 and not 7 ?? for 3 3 5 2: 3 5* 6 3 why is the answer 5 and not 6 ?? Please help! Edited by author 16.03.2015 23:24 Read one more time the problem and thank you for good tests) "Таксист не станет называть цену ниже той, которую предложит Петя. В этом случае он согласится с его ценой. Аналогичным образом поступит и Петя." |
| Hint | Batyr | 1001. Reverse Root | 23 Mar 2016 00:16 | 1 |
Hint Batyr 23 Mar 2016 00:16 USE while(cin >> number), DO NOT USE cin.eof() |
| Pascal:Correct Answer for new | IlushaMax | 1001. Reverse Root | 22 Mar 2016 15:26 | 3 |
var a:array [1..200000] of int64; n,i: integer; begin {$IFNDEF ONLINE_JUDGE} {$ENDIF} while not seekeof do begin inc(i); read(a[i]); end; for n:=i downto 1 do begin writeln(sqrt(a[n]):4:4); end; {$IFNDEF ONLINE_JUDGE} {$ENDIF} end. |
| Hahaha | IlushaMax | 1349. Farm | 22 Mar 2016 01:52 | 1 |
Hahaha IlushaMax 22 Mar 2016 01:52 See on hint in author of the problem. One more hint: Use wiki if you know nothing about Mr. Pierre Edited by author 22.03.2016 02:06 |