OJ Board

I also get WA until i haven't increased the maximum number of connection to node like this:

I think because it's already created ... Thanx for help

I've tried that problem while CUPCAM 2009 championship but I got WA. Here is my algorithm: -Read all cities -Sort it(to use binary search) -Now read the connections and build graph -Read the starting city. -We start from one city, and travel cost is zero. -Using priority queue get the city with min ...

Everyone make mistakes. Good luck for further problem solving.

The solution with matrix also works if you chose the correct data type. Long int is overhead.

res=start=(e+f)/c;
a=(e+f)%c;
while(start)
{
res+=(start+a)/c;
a=(start+a)%c;
start=start/c; **** This is wrong
}

Try use this
while(start)
{
int NumToBuy = (start+a)/c;
res+= NumToBuy;
a=(start+a)%c;
start = NumToBuy;
}

I also have question about one problem from CUPCAM championship, but there is no chapter for that problem...

There is not a chapter for that problem on forum, i will write it here... Problem description http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=117&page=show_problem&problem=2757 I've tried that problem while CUPCAM 2009 championship but I got WA. Here is ...

I'm sorry for wrong output but my program got ACC. I think that some of tests cases are not present in judge test script.

Here is my output

You missed end line symbol at last line of output.

I have a little misunderstood. We need to put ball with number x and there are couple of pegs where it possible, should we simulate all possible placing or can we prove that any will do? First I use simulation of all possibilities but it takes too long, than I tried to place ball on first possible p...

Thanx for CMG, for replies. It's actually isn't good heuristic to assume that there is at least one square with width 1. I also thought about squares placing algorithm optimization, but for n <= 50 I decided that It's not worth it ... But the results you have posted really amazing ... To evandrix - ...

Hello to everyone! I'm just solved this problem and want to share some hints. First of all I use exhausting search with several pruning techniques. My program needs about 15 minutes on my old AMD 2600+ computer to pre-calculate solutions for squares 2..50. There what I use: 0. You need to generate c...

I think it's more convenient for many people to read program in English. It's just a good practice to name variables, functions in English. It's possible to make comment on another language when 1. code will never be read except of author 2. code will be read only by people who understand this langu...