Is this a travelling salesman problem?
Does any simpler solution exist?
Search found 36 matches
- Wed Oct 26, 2005 6:20 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10937 - Blackbeard the Pirate
- Replies: 14
- Views: 7109
- Mon Oct 24, 2005 3:14 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10927 - Bright Lights
- Replies: 26
- Views: 13759
- Mon Oct 24, 2005 3:07 pm
- Forum: Algorithms
- Topic: Partition problem minimum difference between sum of 2 sets
- Replies: 4
- Views: 2020
I'd consider using knapsack.
http://www.nist.gov/dads/HTML/knapsackProblem.html
http://www.nist.gov/dads/HTML/knapsackProblem.html
- Sun Oct 23, 2005 10:53 am
- Forum: Volume 109 (10900-10999)
- Topic: 10927 - Bright Lights
- Replies: 26
- Views: 13759
Hello, wook! Is your algorithm similar to david's? If it is, then yours should be correct too. You must be very precise, because there should be different punctuation marks in the output: Data set 1: All the lights are visible. // dot here Data set 2: Some lights are not visible: // colon here x = -...
- Thu Oct 20, 2005 6:40 pm
- Forum: Algorithms
- Topic: Help Me Please: Combination with DP
- Replies: 4
- Views: 1627
Demonstration: 4-subset of {1, 2, 3, 4, 5, 6}: We start with: 1, 2, 3, 4 1+1 is already here, 2+1 is also, ... but 4+1 is not, so: 1, 2, 3, 5 1, 2, 4, 5 1, 3, 4, 5 2, 3, 4, 5 remember if we upgrade the i-th element y_i to y_i+1, we set everything before it to 1, 2, ... 1, 2, 3, 6 1, 2, 4, 6 1, 3, 4,...
- Thu Oct 20, 2005 3:42 pm
- Forum: Algorithms
- Topic: Help Me Please: Combination with DP
- Replies: 4
- Views: 1627
k-subsets of {1, ..., n} Let the first subset be {1, ..., k}. Find the next subset after Y = {y_1, ..., y_k} (where y_1 < ... < y_k) * find the first i, such that y_i+1 not_in Y * increase y_i by 1, set y_j = j for j < i, and return the new set Y * this fails if i=k, y_k = n, in which case Y = {n-k...
- Sun Sep 11, 2005 9:06 pm
- Forum: Volume 102 (10200-10299)
- Topic: 10278 - Fire Station
- Replies: 59
- Views: 20806
- Sun Sep 11, 2005 8:35 pm
- Forum: Volume 102 (10200-10299)
- Topic: 10278 - Fire Station
- Replies: 59
- Views: 20806
- Wed Jun 22, 2005 12:29 am
- Forum: Volume 3 (300-399)
- Topic: 338 - Long Multiplication
- Replies: 59
- Views: 7294
- Tue Jun 21, 2005 11:26 pm
- Forum: Volume 3 (300-399)
- Topic: 330 - Inventory Maintenance
- Replies: 26
- Views: 7414
Problem 330 - Inventory Maintenance
Hello!
I've recently been working on this problem.
I can't get rid of the P.E. thing.
How many newlines follow the last report?
One, two, three, none?
Does anyone know?
I've recently been working on this problem.
I can't get rid of the P.E. thing.
How many newlines follow the last report?
One, two, three, none?
Does anyone know?
- Tue Jun 21, 2005 11:13 am
- Forum: Off topic (General chit-chat)
- Topic: The Almighty Judge
- Replies: 5
- Views: 2733
- Mon Jun 20, 2005 10:49 pm
- Forum: Off topic (General chit-chat)
- Topic: The Almighty Judge
- Replies: 5
- Views: 2733
- Wed Jun 15, 2005 8:59 pm
- Forum: Volume 107 (10700-10799)
- Topic: 10774 - Repeated Josephus
- Replies: 31
- Views: 8151
- Sat Jun 11, 2005 11:50 pm
- Forum: Other words
- Topic: C/C++ to HTML Converter
- Replies: 1
- Views: 1027
- Sat Jun 11, 2005 11:43 pm
- Forum: Off topic (General chit-chat)
- Topic: The Almighty Judge
- Replies: 5
- Views: 2733
The Almighty Judge
Let's talk about judges.
I'm very interested in how judge works. Maybe there already exist some topic in this spacious forum, so I would appreciate some links.
I wonder how does he stop the program when TLE, how are MLE & OLE measured and so on...
I'm very interested in how judge works. Maybe there already exist some topic in this spacious forum, so I would appreciate some links.

I wonder how does he stop the program when TLE, how are MLE & OLE measured and so on...
