| Show all threads Hide all threads Show all messages Hide all messages |
| What is 6 Test? | ProeBos | 1869. New Year Cruise | 17 Oct 2011 13:16 | 3 |
Edited by author 15.10.2011 20:34 Edited by author 15.10.2011 20:34 alp, thx! Edited by author 17.10.2011 13:34 |
| AC | Kornilenko Leonid (KHAI) | 1576. Telephone Tariffs | 17 Oct 2011 10:53 | 3 |
AC Kornilenko Leonid (KHAI) 22 Jan 2008 15:13 0.001s and 128Kb :) ... for (i=0; i<num; i++) { scanf("%d:%d", &min, &sec); if (min==0 && sec<7) continue; if (sec != 0) min += 1; basic_price += min*basic_pm; min_all += min; } ... p.s.: HF & GL, it's very easy Re: AC Ilya (Vologda SPU) 28 Oct 2009 19:22 I wrote analogous solution by myself with a bit different cycles, but now it gets WA#6, not AC :( Re: AC Rashid Gaziyev 17 Oct 2011 10:53 |
| What is test #6 ??? | bigtik | 1493. One Step from Happiness | 17 Oct 2011 04:51 | 1 |
Can anyone tell me what the test #6 is? In my opinion the solution is correct, but it gives wa on test #6... And also, if the number is 999999 it should take as the next number 000000 or it should consider, that there is no next number and print "No"??? The same for 000000? |
| why Time limit exceed and wa5 | Flip | 1130. Nikifor's Walk | 16 Oct 2011 21:51 | 1 |
- Edited by author 20.11.2011 03:03 |
| WA2 on Java | d3m0n1c | 1226. esreveR redrO | 16 Oct 2011 15:02 | 1 |
Use do {} while(true); And when you read in cycle -1 then write reversed word and [break;] cycle without writing -1 Hope this will help you. Edited by author 16.10.2011 15:41 |
| Please help, what is test #2 | frehgouehg | 1871. Seismic Waves | 16 Oct 2011 01:26 | 1 |
I think that don't understand the task rigth |
| Hi, could the admin suggest what the string is appended in the beginning? Is it "RT @nick: " or "RT@nick: " or sth else? | zayhero | 1871. Seismic Waves | 15 Oct 2011 20:20 | 2 |
Yes, ADMINS please confirm the correctness of the appended string |
| No subject | Nicolay Protasov(Vologda ML) | 1777. Anindilyakwa | 15 Oct 2011 19:29 | 1 |
No subject Nicolay Protasov(Vologda ML) 15 Oct 2011 19:29 Edited by author 29.10.2011 23:25 |
| How many lines of code your solution? | pkl | 1049. Brave Balloonists | 15 Oct 2011 19:28 | 2 |
I think, my solution is very tricky. It can be more simpler and smaller. How many lines of code your solution? |
| Hint | Alexey Dergunov [Samara SAU] | 1871. Seismic Waves | 15 Oct 2011 18:29 | 1 |
Hint Alexey Dergunov [Samara SAU] 15 Oct 2011 18:29 Note that FIRST PERSON IN THE INPUT sends a message first! |
| The English version is different from the Russian version!!! Could admin rejudge it ??? | TrustMe | 1866. Poetic Foot | 15 Oct 2011 18:18 | 3 |
This is totally not fair ! I didn't see any "not a poem" and no admin comes to clarify our confusion. This badly affect our timing and performance. Could you at least rejudge the submissions in the contest according to the English version Edited by author 15.10.2011 18:18 |
| WA 3 | Zhandarbek | 1864. Get-Together at Den's | 15 Oct 2011 17:31 | 4 |
WA 3 Zhandarbek 15 Oct 2011 17:08 Re: WA 3 George_Aloyan[PTSObninsk] 15 Oct 2011 17:15 Not all friends should get money from DAN Re: WA 3 George_Aloyan[PTSObninsk] 15 Oct 2011 17:31 And you should give them their money not thinking of ALL the liters someone brought, but of the liters he paid, but didn't drink. E.G. var k, i, s, n: longint; a: array[1..100] of longint; begin readln(n); for i :=1 to n do begin read(a[i]); s := s + a[i]; end; for i := 1 to n do begin write((a[i]*100) div s, ' '); end; end. - WA3 var k, i, s, n: longint; a: array[1..100] of longint; begin readln(n); for i :=1 to n do begin read(a[i]); s := s + a[i]; end; s := s div (n + 1); for i := 1 to n do a[i] := a[i] - s; s := 0; for i := 1 to n do if a[i] > 0 then s := s + a[i]; for i := 1 to n do begin if (a[i] > 0) then write((a[i]*100) div s, ' ') else write('0 '); end; end. - WA6. And then I came to WA 9) I've done some more mistakes, for example i must calculate real numbers, but i did everything with integer, but it is discussed in sime other topics Edited by author 15.10.2011 18:37 |
| special cases | luckysundog | 1029. Ministry | 15 Oct 2011 17:13 | 1 |
test #2: M==1 => read N numbers from and output index of minimal test #3: N==1 => output '1' M times |
| Вопрос по задаче | GET 100000 | 1865. The Island of Märket | 15 Oct 2011 16:45 | 2 |
Может ли после разделения западная часть принадлежать Финляндии, а восточная Швеции? |
| Fast algo - modelling works!!! | Smilodon_am | 1494. Monobilliards | 15 Oct 2011 16:39 | 3 |
My AC program uses algorithm with process modelling. It's complexity is O(N) in memory and time. Yes, this is the best algo. I use this too. If "process modelling" is for "linked list structure', then I can say the same. The algorithm is so trivial, that the previous sentence is already a sufficient hint. Edited by author 15.10.2011 16:40 |
| what is the this case? | shahdza | 1864. Get-Together at Den's | 15 Oct 2011 15:35 | 3 |
This is wrong input because sum of all a[i] must be > 0 |
| kill me now!!! | shahdza | 1864. Get-Together at Den's | 15 Oct 2011 15:11 | 1 |
|
| WA#20 Help please | Darych | 1405. Goat in the Garden 5 | 15 Oct 2011 01:09 | 1 |
I've got wrong answer on 20th test. Please could anybody give me some test, which will help? |
| Why 1? | hatred | 1861. Graveyard in Deyja | 14 Oct 2011 21:20 | 2 |
Why 1? hatred 14 Oct 2011 21:00 In 2 sample: Arch?????rchibaldIronfist Archibald but we can put Archibald from 1st position and from 9th position. Why answer is 1? Because it cannot appear on BOTH 1 and 9 positions. |
| No subject | Дмитрий | | 14 Oct 2011 19:49 | 1 |
Edited by author 14.10.2011 19:50 |