OJ Board

http://acmicpc-live-archive.uva.es/nuev ... php?p=2339

I am completely stumped by this problem
any body has any ideas how to proceed? may be very advanced math?

i have no theorem to back me up, but here's a guess:

if lh is the hexagon's side length, ah it's area, lt1..ltn the triangle sides and atn their areas, then if u can write lh as a sum of lt1..ltn and ah as a sum of at1..atn then i belive the hexagon can be splited.

at = lt*lt*sqrt(3)/4;
ah = lh*lh*sqrt(3)*3/8; (there are 6 lh/2 side length triangles in a hexagon)

just an idea... (it works for the test cases)

what i'm sure of though is u only have to consider triangle sides that are prime: if u have both 2 and 4, u can use just 2 since a 4 side triangle is 4 2 side triangles

PS: i used backtracking to see if the splits are possible and it takes quite some while

sorry, ah = lh*lh*sqrt(3)*3/2

it may not be enuf to test primes as 2 and 6 may well produce different results than just 2.

actually, a 6 side triangle can be broken into 9 2-side triangles that cover the exact same area.

So, whatever u can cover with a 6 sider, u can also cover with 2 side triangle.

/\ /\
/ \ /\ /\
/____\ / \/ \/\

something like that, with 5,3 and 1 2 side triangles on the rows.