<PREV Problem:
NEXT>
Solved by 43 users: dan, DD, markr, ZlobnyGoblin, Jarovit, JohnJones_001, AsukaNoKaze, lcosvse, FordPerfect, Vyshnya, zmy, Huang_SR, Stranger, Dmitry_Gozman, Heretic2, andyzh1314, gaoyihan, Mishunin_Alexander, tourist, Yagi_Arthur, Wind_Love, svirg, WsemirZ, lutyj, cgy4ever, zloy_mipt, shangjingbo, g201513, UdH-WiNGeR, MaxBuzz, defrager, qizichao, mjastrzab, mathematic, DAV, Woland, Dest, ripatti, kareth, opsupwow, regmar, dragonic, avg79.
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 

Triangle approximation

Time limit = 2 second(s)

Your program should find the closest equilateral triangle A1 B1 C1 to the given triangle ABC, i.e.

r = max( |A A1|, |B B1|, |C C1|)

should be minimal.

Input. Coordinates of A, B, C.

Output. Coordinates of A1, B1, C1.

Input#1
0    0
3.0  0
0    4.0
Output#1
-0.654701 -0.199359
3.154701 0.666667
0.500000 3.532692

Author:
Mathemetical problem. Description, tests and checker by Artem Voroztsov.

<PREV | Problem set | Search related messages | NEXT>


© acm.mipt DevGroup
The page was generated in 200ms

SW soft NIX
ID = 54.161.108.158