OJ Board

Any one has solved this problem :

Given a undirected graph and two vertices : the source and the destination. What is the minimum number of vertices that need to be eliminated so that there is no path from the source to the destination ?

i am thinking but couldn't find a solution.

Moreover, i am ...

any one have experienced with the algorithm that generates the MD5 string for the linux isos from http://www.linuxiso.org ? I just wonder how the algorithm works ? Is MD5 the string generated the unique one ? How comes (a hugh iso file just matchs with a string of several charaters)

Any one tells me where i can get documents about that ? Is "Branch and Bound" a method of screening some stupid cases of exhaustive search ?

Anyone helps me with this :

#include <iostream>

int main()
{
cout<<"DJGPP sucks ?";

return 0;
}

I couldn't compile this successfully and didn't know why DJGPP doesn't know "cout" ? ("cout undeclared")

how come ?

Anyone helps me with this :

#include <iostream>

int main()
{
cout<<"DJGPP sucks ?";

return 0;
}

I couldn't compile this successfully and didn't know why DJGPP doesn't know "cout" ? ("cout undeclared")

how come ?