Hi.

I did some testing using my own randomly generated IO, but was looking for a hosted one to be sure. If you happen to know of any classical weighted assignment problems/min-cost max-flow problems in an OJ, please let me know in the comments.

So far I know about this one: https://www.spoj.com/problems/BABY/

Best.

Hi.

As always the question can be stated fairly easily:

Given a set of points on a 2D plane, how to find a point (x, y) on that plane such that sum of the euclidean distances between the chosen point and the given points is minimum (among all possible choices of (x, y))?

How about finding the same thing in a 3-Dimensional space?

Thank you for the time you put on reading this and thanks in advance for sharing your solution/idea.

Hey there. Thanks for the time you're putting on reading this. I would appreciate it if you could kindly help me to solve this problem.

There are N blue points and N red points on the euclidean plane. We are to match every blue point with exactly one red point with a line segment such that no two line segments intersect.

Thank you in advance.

Hi, I'm having a hard time understanding the author's solution for this problem . I would appreciate it if anyone could explain his/her accepted solution.

Thank you in advance.

Annually , a series of lectures and seminars on Computational Geometry is held at AUT, Tehran, Iran , known as AUT Winter school .

For more information and also registration , click here.

Hello.

I was wondering if anyone had time to take a look at my code and see if they have any idea what is wrong with it .

judge's response is WA on test #1.

My code

Problem Statement

Thank you so much in advance.