| ENG RUS | Timus Online Judge |
Common BoardValentinPerm Tell me the right answer for this test [1] // Problem 1415. Mobile Life 11 Mar 2014 19:29 7 0 0 15 A_Small 0 250 20 Big 300 90 3 tB 310 90 2 tA 320 90 1 tC 290 90 2 tA2 280 90 1 tC2 1 1999 90 -100 90 ValentinPerm Re: Tell me the right answer for this test // Problem 1415. Mobile Life 13 Mar 2014 14:04 Right answer: Power on. CELL_ID:Big, SIGNAL_LEVEL:RED Cell changed. CELL_ID:tA, SIGNAL_LEVEL:ORANGE Signal changed. SIGNAL_LEVEL:YELLOW Signal changed. SIGNAL_LEVEL:GREEN Signal changed. SIGNAL_LEVEL:BLUE Signal changed. SIGNAL_LEVEL:INDIGO Signal changed. SIGNAL_LEVEL:VIOLET Signal changed. SIGNAL_LEVEL:INDIGO Signal changed. SIGNAL_LEVEL:BLUE Signal changed. SIGNAL_LEVEL:GREEN Signal changed. SIGNAL_LEVEL:YELLOW Signal changed. SIGNAL_LEVEL:ORANGE Signal changed. SIGNAL_LEVEL:RED Cell changed. CELL_ID:tA2, SIGNAL_LEVEL:VIOLET Signal changed. SIGNAL_LEVEL:INDIGO Signal changed. SIGNAL_LEVEL:BLUE Signal changed. SIGNAL_LEVEL:GREEN Signal changed. SIGNAL_LEVEL:YELLOW Signal changed. SIGNAL_LEVEL:ORANGE Signal changed. SIGNAL_LEVEL:RED Cell changed. CELL_ID:A_Small, SIGNAL_LEVEL:ORANGE Signal changed. SIGNAL_LEVEL:YELLOW Signal changed. SIGNAL_LEVEL:ORANGE Raximov Ilxom(UrSU)//(r_ilxom2012@mail.ru) why Time limit exceeded 7? how to solve this problem? [3] // Problem 1057. Amount of Degrees 13 Jun 2013 22:45 who know this problem!Time limit exceeded 7 help me please Edited by author 13.06.2013 22:47 Edited by author 13.06.2013 22:48 МОП LUAL.RU Бесплатное решение первых 100 задач // Problem 1057. Amount of Degrees 14 Jun 2013 07:50 vcvycy Re: why Time limit exceeded 7? how to solve this problem? [1] // Problem 1057. Amount of Degrees 27 Aug 2013 19:18 it may be stack overflow.can you speak chinese??? Ilxom(UrSU) Re: why Time limit exceeded 7? how to solve this problem? // Problem 1057. Amount of Degrees 12 Mar 2014 16:17 Thanks pmartynov scanf vs cin // Problem 1286. Starship Travel 11 Mar 2014 22:30 scanf("%lld%lld%lld%lld%lld%lld", &P, &Q, &SL, &SC, &X, &Y); => WA 16 cin >> P >> Q >> SL >> SC >> X >> Y; => AC Is there anyone who can explain this? StatOyL HOW TO AVOID TLE. // Problem 1519. Formula 1 11 Mar 2014 15:04 I just can't stop tle-ing. Should I use 4-based? Edited by author 11.03.2014 15:04 Vedernikoff 'Goryinyich' Sergey (HSE: АОП) 2 ADMINS: Funny mistake in sample (+) // Problem 1297. Palindrome 10 Mar 2014 23:58 'The sample text that could be READED the same in both orders ArozaupalanalapuazorA' =) I.Smirn0ff No subject // Problem 1297. Palindrome 10 Mar 2014 18:46 Edited by author 10.03.2014 19:18 Edited by author 10.03.2014 19:18 Morteza Balvardi wa #21 // Problem 1878. Rubinchik's Cube 10 Mar 2014 18:43 can anybody provide a test case for this error my method is quiet like a brute force but it seems i have forgotten sth Edited by author 10.03.2014 18:44 ucs6 To ADMIN: problem statement is imprecise [2] // Problem 1132. Square Root 1 Feb 2013 06:30 The problem states that the root should be in the range of (0, n - 1), which looks like saying 0 < x < n - 1. However apparently x can be equal to n - 1! I spent several hours stuck on WA 2 just because of this. Please change it to [0, n - 1] or whatever is precise. Sandro (USU) Fixed (-) [1] // Problem 1132. Square Root 3 Feb 2013 02:34 raggzy Re: Fixed (-) // Problem 1132. Square Root 10 Mar 2014 17:59 Could you please next test case in statement? 9 7 (ans is same as for 2 7, for people to understand that a can be greater than n) Because it's not precise and personally I spent 2-3 hours just to add (%n) stuff. Andrey 1001 // Problem 1001. Reverse Root 10 Mar 2014 15:48 give me some test, please. YSYMYTH tle // Problem 2009. Canteen Line 9 Mar 2014 22:06 but O(n^2) algorithm Andrey wrong answer test#7. 1001. // Problem 1001. Reverse Root 9 Mar 2014 00:37 I got a problem with test #7 but I don't know which is this test. Any know? Edited by author 09.03.2014 01:14 Edited by author 09.03.2014 01:16 Edited by author 09.03.2014 01:16 d000179 What is test #1 [2] // Problem 1110. Power 2 Apr 2009 20:35 I got a problem with test #1 but I don't know which is this test. Any know? Thank artyomushko Re: What is test #1 // Problem 1110. Power 7 Feb 2014 07:04 In 2 6 4 Out 2 4 [SESC UFU] Asbest Re: What is test #1 // Problem 1110. Power 8 Mar 2014 22:05 You've forgot about "If no such numbers exist then output −1." Roman Rubanenko To admins. Test #5 seems to be wrong. // Problem 1487. Chinese Football 7 Mar 2014 18:21 According to my program, test #5 contains cycles. Isn't it forbidden by the statement? triangle.korbut please help with WA4 [3] // Problem 2003. Simple Magic 5 Jan 2014 19:46 Edited by author 18.01.2014 03:05 IgorKoval [PskovSU] Re: please help with WA4 [1] // Problem 2003. Simple Magic 10 Jan 2014 20:08 3 2 1 2 answer: 2 ^_^ K0rbutDan1el Re: please help with WA4 // Problem 2003. Simple Magic 11 Jan 2014 01:23 Thanks) sotamawhat Re: please help with WA4 // Problem 2003. Simple Magic 7 Mar 2014 18:21 why delete ？ Vit Demidenko explain sample pls // Problem 1315. MDPAR and MIIAR 7 Mar 2014 16:30 why for D==5 answer is "NO"? IgorKoval [PskovSU] WA3 [2] // Problem 2007. Mutants versus Machines 16 Jan 2014 22:05 zzza zzz answer: a It test help me. It's not test 3. Good luck. =) IgorKoval [PskovSU] Re: WA3 [1] // Problem 2007. Mutants versus Machines 16 Jan 2014 22:27 And another test. a xxxzzz answer: axxxz YSYMYTH Re: WA3 // Problem 2007. Mutants versus Machines 6 Mar 2014 14:23 Can you show me your solution to the problem? I keep failing wa 14. After all what you provided are weak tests :< sotamawhat a solution // Problem 2001. Mathematicians and Berries 5 Mar 2014 19:40 #include <iostream> using namespace std; int main() { int a[3]; int b[3]; int sum,m1,m2; cin>>a[0]>>b[0]; if(a[0]<0||b[0]<0||a[0]>10000||b[0]>10000) exit(1); sum=a[0]+b[0]; cin>>a[1]>>b[1]; if(a[1]<0||b[1]<0||a[1]>10000||b[1]>10000) exit(1); if(b[1]>b[0]||(a[1]+b[1]!=sum))exit(1); cin>>a[2]>>b[2]; if(a[2]<0||b[2]<0||a[2]>10000||b[2]>10000) exit(1); if(a[2]>a[0]||(a[2]+b[2]!=sum))exit(1); m1=a[0]-a[2]; m2=b[0]-b[1]; cout<<m1<<' '<<m2; return 0; } Edited by author 05.03.2014 20:47 CHL,PRC Any clue? // Problem 1755. Cake 4 Mar 2014 22:08 Fail at #14 disa Статья Скиданова как он стал чемпионом Урала и завоевал золотые медали Чемпионата мира 4 Mar 2014 16:46 Всем привет, ищу статью Скиданова, в которой он рассказывает, как стал чемпионом Урала и завоевал золотые медали Чемпионата мира. В списке публикаций года на snarknews, блогах Скиданова на codeforces и wordpress эту статью не нашел. В статье рассказывается, как Александр забивал на учебу ради тренировок, есть фразы вроде: «Не забывайте, что вы – программисты, а не машины для решения задач», «Вам что, не приходилось препода первый раз видеть на экзамене». Поделитесь ссылкой, кто помнит эту статью. Буду признателен. Disintegrator WA 30 // Problem 1269. Obscene Words Filter 3 Mar 2014 21:03 WA 30. Can anyone help me? Or just give AC code? I have spent to much time on this problem. email: LegionN7@i.ua Update: Accepted. Edited by author 05.03.2014 18:52
|