OJ Board

hi .. who can help me ? i got WA for this Q many time .. my Algorithm is very simple .. i add the edge weights and store them in sumEdges .. if there are 2 odd nodes , i find the min path between this 2 node with dijkstra algorithm , then add with sumEdges.. then print sumEdges ..

[#include ...

it should be 0..

Hi...
I get TLE for this problem..
Who can help me ?
This is My code:

#include <iostream>

using namespace std;

const int Max=1000005;
int a[Max];
int prime[Max];


void main(){
long int i,j,sw;
long int num;
for(i=0;i<Max;i++){
a[i]=1;
prime[i]=1;
}
for(i=2;i<Max;i++){
if(a[i]==1){
for ...

see the next post!!!