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.
UserDateAttemptTimeCMSC
DAV`27 jan 2010`C++100.02238
g201513`16 oct 2008`C++100.02247
AsukaNoKaze`04 jul 2006`C++500.01249
andyzh1314`12 nov 2007`C++100.01253
lcosvse`24 may 2006`C++100.01254
Huang_SR`04 jul 2006`C++100.01269
Yagi_Arthur`13 mar 2008`FPC100.01291
gaoyihan`24 nov 2007`C++200.02305
Wind_Love`13 mar 2008`C++200.01373
markr`13 nov 2005`C++100.02395
 C++ 34 Java 3 Kylix 3 FPC 3
` >  >  >  >  >  >  >  >  >  > `

## 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 DevGroupThe page was generated in 180ms