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

Discussion of Problem 1196. History Exam

SubjectAuthorProblemUpdatedAnswers
Is it possible to get faster than O(m log n) time?Junjie Liang1196. History Exam18 Feb 2007 12:474  
How to solved it in time limit? I use sort bin-tree,but time overflow......aaakkk1196. History Exam18 Feb 2007 02:462  
STL questionTodor Tsonkov1196. History Exam17 Feb 2007 23:452  
please tell me why i have acces violation on test #8? Husan1196. History Exam24 Jan 2007 18:371  
Is my algorithm correct??David Tvaltchrelidze1196. History Exam20 Dec 2006 23:270  
how to prevent Time limit exceeded? Please proof read my program...Henrywong1196. History Exam9 Dec 2006 19:571  
Error in testsneoGolden1196. History Exam3 Dec 2006 16:201  
No subjectAlexander Prokazyuk (TKTL)1196. History Exam31 Oct 2006 20:400  
What's wrong with my program?nut_nic1196. History Exam8 Sep 2006 14:581  
Could someone tell me test 10??thanks a lot!!!Cheryl Xie1196. History Exam6 Jul 2006 20:410  
WA #4 Help plz...Denis Vl1196. History Exam6 Jun 2006 15:402  
Help! Why my program got WA at test1???Tang RZ1196. History Exam15 Oct 2004 13:462  
WA on test 10. Does anyone have any tips on how to solve it (and/or) where's my bug?Learning_C1196. History Exam21 Sep 2004 14:320  
could anyone tell me how to solve MLE?young master1196. History Exam18 Jun 2004 18:483  
HINTDWED1196. History Exam10 May 2004 01:150  
Incorrect restrictions in problem statementEvgeni1196. History Exam30 Apr 2004 16:066  

Style: flat | tree | nested
Thread Order: bubble | fixed
© 2000–2024 Timus Online Judge Team. All rights reserved.