Search found 8 matches

by Dimitar
Thu Aug 10, 2006 8:03 pm
Forum: Algorithms
Topic: minimum edge for deletion
Replies: 21
Views: 7098

Why wrong answer?

In the solution you have the edges (1,2), (3,4) and (5,6). Every vertex is of odd degree (1), so this solution is correct.
by Dimitar
Sat Aug 05, 2006 10:15 am
Forum: Algorithms
Topic: minimum edge for deletion
Replies: 21
Views: 7098

Now I got it :)

Thanks for the help!
by Dimitar
Sat Aug 05, 2006 8:29 am
Forum: Algorithms
Topic: minimum edge for deletion
Replies: 21
Views: 7098

Now crhismoh, your algorithm is wrong.. It could solve the problem of making all vertices in a graph with an odd degree, but in the IOI problem there's an additional constraint - the number of the edges in the solution should be less or equal to the number of vertices. This is where your algorithm f...
by Dimitar
Fri Aug 04, 2006 4:24 pm
Forum: Algorithms
Topic: minimum edge for deletion
Replies: 21
Views: 7098

About the IOI problem.. I can't figure out an algorithm that could handle with this case: number of vertices - 4 number of edges - 6 - (1,2) (1,3) (1,4) (2,3) (2,4) (3,4) 1 /|\ / | \ / | \ / | \ / | \ / | \ 3------2------4 \___________/ Or more generally, what to do when all vertices are odd but the...
by Dimitar
Wed Feb 01, 2006 3:36 pm
Forum: Volume 1 (100-199)
Topic: 147 - Dollars
Replies: 233
Views: 25340

Thanks, it works now!!! Although I don't understand the problem with the precision...
by Dimitar
Tue Jan 31, 2006 6:46 pm
Forum: Volume 1 (100-199)
Topic: 147 - Dollars
Replies: 233
Views: 25340

[147]

It works on my computer, but on the judge it gives a WA. I've read all the topics for this problem and I still can't find out what is wrong :(

Code: Select all

Deleted code...
by Dimitar
Tue Sep 20, 2005 5:37 pm
Forum: Algorithms
Topic: Min-Max Search
Replies: 7
Views: 1784

OK, thanks
by Dimitar
Tue Sep 20, 2005 11:45 am
Forum: Algorithms
Topic: Min-Max Search
Replies: 7
Views: 1784

Min-Max Search

Can you help me with this task. I think that it can be solved with min-max search, but i can't find an example on how to implement this algorithm. Game Two players are playing this game: There are n numbers (n<=128), ordered in a row. The first player takes one number from the left or the right side...

Go to advanced search