Problem numbers?

Post here if you don't find any other place for your post. But please, stay on-topic: algorithms, programming or something related to this web site and its services.

Moderator: Board moderators

Post Reply
mafattah
New poster
Posts: 23
Joined: Fri Apr 26, 2002 1:00 am
Location: Cairo, Egypt

Problem numbers?

Post by mafattah »

I have seen two problems more than a year ago, but I cannot remember their numbers, so I can't reach them again :-)

One problem is about getting an optimal solution for a game like Click-o-mania.

The other problem is about bombs that are thrown to demolish circular areas and the total destroyed area is required.

Does anybody remember the problem numbers? :-D Thanks.

Hadi
Learning poster
Posts: 63
Joined: Mon Aug 29, 2005 8:13 am
Location: Tebriz
Contact:

Post by Hadi »

http://acm.uva.es/p/v105/10559.html is similar to Click-o-mania, but the difference is that it is one-dimensional. Is this what u were looking for?

mafattah
New poster
Posts: 23
Joined: Fri Apr 26, 2002 1:00 am
Location: Cairo, Egypt

Post by mafattah »

Thanks :) I am not sure if the Click-o-mania problem was for 1-D or 2-D, but this seems to be the right problem. I suppose the problem in 2-D will be really so hard that you can't expect to find such a problem in UVA, unless the limits allow for an exponential-time algorithm. Does anybody know a similar problem but in 2-D?

Post Reply

Return to “Other words”