ENG
RUS
Timus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
Common Board
Subject
Author
Problem
Updated
Answers
ft!%%%%
liuzhizhi
1119
. Metro
22 Sep 2004 19:48
0
It's very simple problem, but you don't need to sort the elements :-)
Veselin Kolev
1053
. Pinocchio
22 Sep 2004 18:01
1
O(NlogN) solution,that works 0.078 sec!!!
Ilya Razenshteyn
1028
. Stars
22 Sep 2004 17:23
3
keep getting wrong answer
Emilian Miron
1326
. Bottle Taps
21 Sep 2004 19:59
1
You have not very good compiler.
HAI
1049
. Brave Balloonists
21 Sep 2004 17:28
0
WA on test 10. Does anyone have any tips on how to solve it (and/or) where's my bug?
Learning_C
1196
. History Exam
21 Sep 2004 14:32
0
Whot Name hase Fail
Slabac
1210
. Kind Spirits
21 Sep 2004 02:48
0
Useful information.
dmitry.volosnykh[IU7.BMSTU]
1232
. Asteroid Landing
20 Sep 2004 17:47
0
I think this is O(n)
PTD_PDP
1059
. Expression
19 Sep 2004 22:34
1
I ve solved it with N Dijkstras. I didn't use any of the solutions posted here. Just wanna know why it works! Proof wanted!(-)
Alex[LSD]
1004
. Sightseeing Trip
19 Sep 2004 15:19
0
[to admins] No problem can be submitted now. Problems are stopped up on compilation
arn.zarn
19 Sep 2004 13:29
6
The description of this problem is not full... (+)
Anton Vasilev
1018
. Binary Apple Tree
19 Sep 2004 08:57
3
1018 (A Binary Apple Tree) Just answer what is output for this test cases or explain me...
Locomotive
1018
. Binary Apple Tree
19 Sep 2004 08:43
1
I am proud to solve all the problems again (+)
Dmitry 'Diman_YES' Kovalioff. Retired
18 Sep 2004 22:33
5
This problem is very easy.We can solve it with O(N^2).But it seems like that exist a O(N) algorithm.
zhougelin
1297
. Palindrome
18 Sep 2004 20:10
2
It's 9.18 today! Bless the world peace.
zhougelin
18 Sep 2004 20:09
0
WAed N times on Test #1! Anything strange about that test?
Maigo Akisame (maigoakisame@yahoo.com.cn)
1007
. Code Words
18 Sep 2004 18:26
4
What's wrong with ural's judge?
cmdmaja
18 Sep 2004 16:43
1
What can I do on Memory optimize ??
Fate
1316
. Electronic Auction
17 Sep 2004 18:13
9
Are there any solutions faster than O(nlogn)?
Yaroslavtsev Grigory (SpbSPU)
1245
. Pictures
17 Sep 2004 01:40
0
Previous Page
New topic
Style:
flat
|
tree
|
nested
Thread Order:
bubble
|
fixed
© 2000–2026
Timus Online Judge Team
. All rights reserved.