ENG  RUSTimus 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

SubjectAuthorProblemUpdatedAnswers
To Admins: Weak testsDmi3Molodov1242. Werewolf13 Jun 2026 01:510  
Please add this test.Zayakin Andrey[PermSU]1202. Rectangles Travel12 Jun 2026 06:571  
What is the answer for...Nazar1202. Rectangles Travel12 Jun 2026 06:573  
Why this taks can not be solved with Trie? :@@Giorgi Pataraia [Tbilisi SU]1414. Astronomical Database12 Jun 2026 00:265  
Some testsandreyDagger1998. The old Padawan11 Jun 2026 23:092  
WA on test 6 in C++Mamuka Sakhelashvili [Freeuni]1316. Electronic Auction11 Jun 2026 22:454  
Is there better solution then O(n^3) for each test?vgu1221. Malevich Strikes Back!11 Jun 2026 21:354  
Problem description LaVuna [NULP]1221. Malevich Strikes Back!11 Jun 2026 21:171  
Can we do this in O(N) ?Nikunj Banka1031. Railway Tickets10 Jun 2026 11:524  
WA#11GePo1291. Gear-wheels10 Jun 2026 04:556  
HintSolver2030. Awesome Backup System10 Jun 2026 04:190  
Small hintandreyDagger1155. Troubleduons10 Jun 2026 01:071  
Any Good algorithm?? My algo is O( H * W * ( 5 + 5 + 1 )^2 ).c_pp1121. Branches9 Jun 2026 10:461  
best testsDmi3Molodov1800. Murphy's Law9 Jun 2026 05:551  
You can use a segment tree for brace balance checkingLevon Oganesyan1574. Mathematicians and brackets8 Jun 2026 21:121  
Answer can be negativeIgor Parfenov1300. Taxes8 Jun 2026 17:060  
Could anyone provide me with an O(n) solution? My works O(n log(n))Sq11651. Shortest Subchain8 Jun 2026 15:301  
Accepted 0.156 2 993 КБTakeOver1067. Disk Tree7 Jun 2026 23:423  
WA test 8Henrique1588. Jamaica7 Jun 2026 02:242  
Better algorithmLLM_AI_Testing1553. Caves and Tunnels6 Jun 2026 21:230  

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