OJ Board

can any one explain why the output for 5 9 1 0 5 4 is 6 it seems to be 5 for me using mergesort here is my code #include<stdio.h> #include<stdlib.h> #define Max 500000 #define MaxValue 999999999 long long int A[Max+2],temp[Max+2],R[Max+2],swap,s,n,inf = MaxValue+1; void merge(long long int numbers[]...

thanks for the reply.
i have got the website.
but i could not find any help what i needed.
so i asked for help in the board.

can u explain how can i do that.
one thing i want to use priority queue

i want to insert two types of value in a proirity q using stl. the problem is shown in the follwing example: 10 1 100 2 12 4 1000 3 so if i call q.top() then it will be 1000. now i also want to get the position of 1000 which is 3. how can i get it. details information will be helpful. thanks in adva...

hi everybody.
can anybody who got a.c. explain his algo.
i got stuck to solve this problem.
plz........

hi everybody.i became very week in geometry(due to lack of practice).
so can someone provide me some online references so that i could get some help from the very begining.
n.b: i find hard searching at mathworld

thanks adrian . i was thinking in a wrong way.i forgot to consider
"Clearly, each pi^qi has to be a divisor of one of the numbers"

now i am a bit confused.how can i get solution for such input.

what abt 4
4 = 4,since 2*2=4 but lcm of 2,2=2;//corrcted
or 4 = 5, 4*1=4,4+1=5

hi totster.
should the answer of 234 be 21.
you have write for 234 , 24
atleat i can say that 234=2*3*3*13,then sum =21.

thanks a lot.really a silly mistake.thanks onece again.

the shortest one.


if(G[s][e]>cost)
{
G[s][e]=cost;
G[e][s]=cost;
}
hope i am right

Hi every body. this problem seems to be easy. what i have done is 1. i used floyd warshall for shortest distance 2. then check whether any point exist which is equidistance from 1,2,3,4,5 (the fr five points) 3.if such point exists then did what the problem said. sorry for paosting the code. but i h...

can some body give me some useful link for finding the k-th shortest path in c or c++.

Thanks a lot.
Finally i got A.C.

i have solved several problems of bm using my modified ford fulkerson
algorithm.
but why the following code gives w.a.
plz help.thanks in advance.