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
To admin: about the testdata of this problem.
CleverKid
1010
. Discrete Function
16 Mar 2003 17:47
14
To Leonid Volkov !!! Can you help me ??? What's wrong with my code ????
Romanchik Vitaly
1253
. Necrologues
16 Mar 2003 13:37
0
I use 'array[500,500]',then use dispose,Why momey limited?
Lin
1250
. Sea Burial
16 Mar 2003 13:12
0
What's wrong??? Give me ANY test, please!
Dream Team ETU
1253
. Necrologues
16 Mar 2003 13:12
0
What's wrong with my solution?
NoName00
1255
. Graveyard of the Cosa Nostra
16 Mar 2003 09:48
1
Is Sample Right?
lijiganjun
1254
. Die Hard
16 Mar 2003 08:46
1
What's wrong in my code?
Evgeny
1249
. Ancient Necropolis
16 Mar 2003 05:26
1
What's wrong??? Give me ANY test, please!
Dream Team ETU
1249
. Ancient Necropolis
16 Mar 2003 03:32
0
What type of error is "Internal Error" ?
Nikolay Marinov
15 Mar 2003 20:51
0
Any1 tell me why my greedy (obvious) doesn`t work correct?
Locomotive
1252
. Sorting the Tombstones
15 Mar 2003 19:31
1
what's wrong ?!?! it's so simple
uuuuuuu
15 Mar 2003 18:41
0
Какое наибольшее число дне
Григорьев
15 Mar 2003 18:25
0
HAHAHAHAAA LOOk@ PROBLEM #2 DISCUSS! IT IS 1201 NOT 2OF CONTEST!!! WHY?????????
Locomotive
15 Mar 2003 18:20
0
Whi WAITING.
I am david. Tabo.
15 Mar 2003 17:08
0
In problem A write: "read(m,n)" instead of "read(n,m)"! (-)
Renat Mullakhanov
15 Mar 2003 17:07
1
hey any1 help
Locomotive
15 Mar 2003 17:05
1
hey any1 help
Locomotive
15 Mar 2003 17:05
0
hey any1 help
Locomotive
15 Mar 2003 17:05
0
hey any1 help
Locomotive
15 Mar 2003 17:05
0
Who AC?Give me the program!
Noname
15 Mar 2003 17:00
1
Previous Page
New topic
Style:
flat
|
tree
|
nested
Thread Order:
bubble
|
fixed
© 2000–2026
Timus Online Judge Team
. All rights reserved.