Common Board @ Timus Online Judge

Subject	Author	Problem	Updated	Answers
Attention!	Sepehr	1404. Easy to Hack!	15 Aug 2011 21:01	0
hint	Aydar	1638. Bookworm	15 Aug 2011 20:00	2
wa14?	Aydar	1787. Turn for MEGA	15 Aug 2011 14:27	0
Mister Chery	Meni Packeou	1566. Triangular Postcards	15 Aug 2011 06:40	7
WA# 6. please help!	Smusenok Sergiy Andriyovich (KhAI)	1566. Triangular Postcards	15 Aug 2011 04:05	1
WA9?	kai_99	1777. Anindilyakwa	14 Aug 2011 21:21	3
WHY WA #10 THIS IS MY CODE	HACKER	1038. Spell Checker	14 Aug 2011 18:20	0
I don't know how read input	Yuri.Pechatnov	1006. Square Frames	14 Aug 2011 16:59	0
quicksort	Aydar	1563. Bayan	14 Aug 2011 03:39	0
quicksort	Aydar	1563. Bayan	14 Aug 2011 03:39	0
WA #2 HELP ME!	HACKER	1038. Spell Checker	13 Aug 2011 23:47	0
Low memory solution	Xel	1197. Lonesome Knight	13 Aug 2011 16:18	5
Hint	Pong	1046. Geometrical Dreams	13 Aug 2011 11:10	0
Unclear problem statement	Denis Koshman	1542. Autocompletion	12 Aug 2011 19:08	2
Help Me!	TiMiD	1585. Penguins	12 Aug 2011 12:54	2
Hint	MadMag	1354. Palindrome. Again Palindrome	12 Aug 2011 09:45	0
WA #2	vietlong	1103. Pencils and Circles	11 Aug 2011 23:21	0
WA2.. don't use multitest	-XraY-	1052. Rabbit Hunt	11 Aug 2011 18:50	1
I wonder the O(n*nlogn) algorithm to solve this problem , who could tell me ? Thx~	Yular	1052. Rabbit Hunt	11 Aug 2011 18:47	0
Why my algorithm WA #2?	vietlong	1167. Bicolored Horses	11 Aug 2011 17:04	1

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