Common Board @ Timus Online Judge

Subject	Author	Problem	Updated	Answers
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
WA on test #4	Alex Svetkin [INVENTOS]	1316. Electronic Auction	15 Sep 2004 22:22	1
Coordinates can be negative!	Stupnikov Pavel	1245. Pictures	15 Sep 2004 21:41	1
problem ranklist	Joe Montana		15 Sep 2004 14:31	2
Dijkstra & Floyd	dmitry.volosnykh[IU7.BMSTU]	1004. Sightseeing Trip	15 Sep 2004 02:30	1
What answer is good ???	Nazar Revutsky	1193. Queue at the Exam	14 Sep 2004 19:00	2
int64	Paul Diac		13 Sep 2004 23:18	3

Style: flat | tree | nested
Thread Order: bubble | fixed