I don't know how could i choose next point.
I have some ideas about it:
1. The solution isn't very complexity(maybe it uses sorting)
2. I think, Elephpotamus always can eat all pumpkins
3. And our path should be spin or smth like it.
Help plz

It's nice and easy problem

1) find the point witch min Y
2) build angles
3) sort angles
4) print answer.

What angles should I built? Between (a[1],a[ymin]) and (a[ymin],a[i])?

????

A(Point[i].X, Point[i].Y)
B(Ymin.X, Ymin.Y)
C(Point[i].X, Ymin.Y)

I have <...> as result of doing this task. I think  it's terrible. Help me more. I don't know what kind of mistake I have... WA8 is terrible

Edited by author 01.04.2006 04:49

If you want I can send my solution!
My e-mail: Pio@mail.by

I used idea of solution to problem 1173 with some updates:
At 1173:
"No 3 points on the same straight line"
At 1444:
"Not all points on the same straight line".
Try tests, were some points are on the same straight line.
My WA solution breaks on the same tests.