Not only that problem, but quite regularly in online contests there are poblems with a tight timelimit that does not allow a - in my opinion - reasonable factor in running time compared to a judge solution.
I understand that the resources for judging are limited and low time limits are needed so ...
Search found 27 matches
- Sun Mar 14, 2004 4:41 pm
- Forum: Other words
- Topic: Time Limits of World Finals Warmup Contest
- Replies: 2
- Views: 1745
- Sat Dec 27, 2003 9:26 pm
- Forum: C++
- Topic: How to skip lines while using cin <<
- Replies: 7
- Views: 6418
... but be careful if you want to skip lines after using cin << ..., because there is still a newline left.
It might be a good idea - whenever there is a need to read a whole line - to read all lines in whole and then getting the values with istringstream or sscanf, then there is no need to worry ...
It might be a good idea - whenever there is a need to read a whole line - to read all lines in whole and then getting the values with istringstream or sscanf, then there is no need to worry ...
- Sat Dec 27, 2003 8:38 pm
- Forum: Other words
- Topic: Editor for the Finals
- Replies: 7
- Views: 2513
- Sun Jun 08, 2003 10:12 am
- Forum: C++
- Topic: why does this code got Compilation Error
- Replies: 3
- Views: 2906
- Sun May 04, 2003 11:50 am
- Forum: Other words
- Topic: Appeal to acm.uva.es administrators and problemsetters.
- Replies: 12
- Views: 3326
I think that a classification would give more than a hint and completely take the fun out of problem solving. If just interested in a particular algorithm/issue, I'd rather recommend looking into a textbook. And if someone cares more about programming (than problem solving), he can pick problems ...
- Wed Apr 30, 2003 8:54 pm
- Forum: C++
- Topic: Compile Error
- Replies: 3
- Views: 2465
- Fri Feb 28, 2003 8:18 pm
- Forum: C++
- Topic: Input tips (>>, getline, gets) and newlines
- Replies: 2
- Views: 4348
- Fri Jan 24, 2003 1:02 pm
- Forum: C
- Topic: Quick Sort
- Replies: 6
- Views: 3966
- Fri Jan 24, 2003 12:51 pm
- Forum: Other words
- Topic: Problems to appear !!!
- Replies: 1
- Views: 1229
- Sun Jan 05, 2003 1:00 am
- Forum: Other words
- Topic: time trouble
- Replies: 1
- Views: 1408
Sometimes I wonder why people don't use search engines to get their questions answered quickly (no offense meant).
Go for example to http://www.google.de/ or http://www.yahoo.com/ , search for "utc gmt", follow the first hit ( http://www.dxing.com/utcgmt.htm ), and although that page doesn't list ...
Go for example to http://www.google.de/ or http://www.yahoo.com/ , search for "utc gmt", follow the first hit ( http://www.dxing.com/utcgmt.htm ), and although that page doesn't list ...
- Wed Dec 25, 2002 6:31 pm
- Forum: Other words
- Topic: What does ouput limit exited mean?
- Replies: 1
- Views: 1461
http://acm.uva.es/problemset/replies.html
If the judgement was 'Output Limit Exceeded', it means that you wrote to much to stdout (i.e. a lot more then the correct output would be).
If the judgement was 'Output Limit Exceeded', it means that you wrote to much to stdout (i.e. a lot more then the correct output would be).
- Sun Nov 24, 2002 10:25 pm
- Forum: Algorithms
- Topic: About Dynamic Programming
- Replies: 5
- Views: 4346
Here you can find an assigment of some online judge problems to several categories (including DP): http://www.cs.sunysb.edu/~skiena/390/hw.html
There are a lot more DP problems on the site (like 531 Compromise), but the ones listed by the link above should do for the beginning.
There are a lot more DP problems on the site (like 531 Compromise), but the ones listed by the link above should do for the beginning.
- Sun Nov 24, 2002 10:02 pm
- Forum: C
- Topic: Multi tasking in C!!
- Replies: 1
- Views: 2298
- Wed Nov 06, 2002 7:54 pm
- Forum: Algorithms
- Topic: Longest path
- Replies: 5
- Views: 5207
I agree with zorbathut, solving the stated problem would solve the Hamilton Path Problem, which is NP-complete.
Discussing this, it might also be interesting to look at a related, yet easy problem: Finding the longest path in an undirected acyclic graph (see 10308 Roads in the North) which can be ...
Discussing this, it might also be interesting to look at a related, yet easy problem: Finding the longest path in an undirected acyclic graph (see 10308 Roads in the North) which can be ...
- Tue Nov 05, 2002 12:16 pm
- Forum: C++
- Topic: ANSI C++ Manual
- Replies: 5
- Views: 3901