OJ Board

getting WA in this prob. i used dijkstra.
my procedure is

1)for all 'e' calculate the distance between police and highway exit and also between brothers and highway exit. while calculating the distance between brothers and highway exit i didn't use the node where the police starts.

2) if the the ...

Just take it easy! there is a simple solution to this problem. Of course finding this solution is not so simple, where in the contest, the first accepted solution was after 62 minutes and there was only 14 accepted solution from about 90 teams.
for any N > 4 you can find a way that the wonder team's ...

saiful_sust wrote:thanks 4 ur reply
BUT?????

i don't understand it..
how it is ans 3.

99999999999
Sum1 = 99
Sum2 = 18
Sum3 = 9
So it has 9-degree 3.

Hi,
I can't find why it gives run time error. I checked it for many cases and it hasn't any problem for those cases.
May anyone help me?!
This is my code got Run Time Error
#include <iostream>
#include <cmath>
#include <string>
#include <sstream>
#include <vector>

using namespace std;

#define Max ...

Try this input :
99999999999
Your program gives :
99999999999 is a multiple of 9 and has 9-degree 2.
But the answer is :
99999999999 is a multiple of 9 and has 9-degree 3.
I hope it helps you to correct your code!