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
Discussion of Problem
1100
. Final Standings
Subject
Author
Problem
Updated
Answers
Is it possible to use radix sort?
Evil Cheater
1100
. Final Standings
30 Apr 2004 05:08
5
How to avoid Memory Limit Exced!
Miguel Angel
1100
. Final Standings
29 Apr 2004 18:13
3
ac source: 0.562 sec 961 КB any optimizations?
Dinu Adrian Florin
1100
. Final Standings
29 Apr 2004 17:42
0
Is N really < 150000?
Renato Baba
1100
. Final Standings
29 Apr 2004 17:37
2
Who can tell me how solve this problem? I still MLE on test 11.....
hello
1100
. Final Standings
28 Apr 2004 19:38
3
0.911sec,733k
simply
1100
. Final Standings
12 Apr 2004 17:34
4
now-0.891sec,667k
simply
1100
. Final Standings
2 Aug 2003 10:35
1
BEWARE: N CAN BE 150000 !?!?!?
Simon
1100
. Final Standings
18 Feb 2003 19:55
0
It's easy. Look at me
Zhang Ran
1100
. Final Standings
4 Feb 2003 13:05
3
Help! Memory used is negative??????? and crash some more!!!!
abc
1100
. Final Standings
1 Feb 2003 20:53
1
Arrays called M[]
Nickolay Todorov
1100
. Final Standings
23 Jan 2003 18:22
2
Wow, same solution, different languague(c++, pascal) cause a big difference of time,Surely the "cin" and "cout" are ver very slow!!!! (-)
Miguel Angel
1100
. Final Standings
26 Feb 2002 09:22
0
No fear for memory excceed
Lee Junhui Alvin
1100
. Final Standings
18 Feb 2002 14:43
0
i think test case is wrong
TheBlaNK
1100
. Final Standings
10 Feb 2002 12:50
1
How to do this problem?
Li, Yi
1100
. Final Standings
15 Jan 2002 16:43
8
What should I output?
Valentin Mihov
1100
. Final Standings
1 Dec 2001 02:11
1
Have no idea why my program gets "Wrong Answer"!!
platypus
1100
. Final Standings
27 Sep 2001 22:47
0
New topic
Style:
flat
|
tree
|
nested
Thread Order:
bubble
|
fixed
© 2000–2024
Timus Online Judge Team
. All rights reserved.