OJ Board

In this problem you must find the Convex Hull, but you must consider co-linear points.
So, if you have an input which is formed only by colinear points, all of them will be in the Hull. If the input has only one point, the Hull will be itself.
Notice that even if you have a polygon (let's say a ...

About reading until the end of line, I
usualy do a gets(s) and then a sequence of
sscanf's in the string s. You can do
something like this, for reading a variable
number of integers:

gets(s);
for(i = 0; sscanf(s,"%d %[^n]",&num ,
tail); i++, strcpy(s,tail));

Well, maybe something like this, but I ...

Hi!

Well, only if you do some sort of precalculation. Otherwise, the primality test could be done in constant time too...

Best Regards, Casimiro