OJ Board

Hi, everybody

In year 2001 we had an acm contest in the middle east site at sharif university and this problem is one of those problems.

you can see this problem at the link below. say me your opinions about the solution, please.

URL : http://sharif.ac.ir/~acmicpc/acmicpc01/problems/B.doc

Also, you can find the input/output at the link below :

URL : http://sharif.ac.ir/~acmicpc/acmicpc01/ ... t-data.zip

After the all , if you like , you can find the other problems at the link below:

URL : http://sharif.ac.ir/~acmicpc/acmicpc01/problems.html


Sincerely yours,
Shahab Tasharrofi

I saw the problem, it's very interesting, i think there's a solution if:
Let Xi the length of the i triangle you can cut from it.
Let Yi the number of triangles of side Xi.
Let L the length of the side of the hex.

6*L^2 = Sum ( Yi * Xi^2 )

Of course, imposing some conditions like:

Yi = k Yi+1

Where "k" is a var that you can calculate.

Thank you for your reply,

But I can't understand the proof of your algorithm , and after that have you any idea about a sufficient condition? And if so, i would be happy to hear that.

Sincerely yours,
Shahab Tasharrofi