2010年puzzleup竞赛第1题
时间:2010年07月15日作者:amao查看次数:2,231 次评论次数:1
原题:http://www.puzzleup.com/2010/puzzle/?219
You are using a drawing program on a computer. You place several equilateral triangles of the same size on the screen. You observe that you can cover any of these triangles by moving the other triangles without rotating.
What is the minimum number of triangles you have to place on the screen to ensure that this observation holds true for every case?
==============
注:关于puzzleup竞赛,参见这里
声明: 本文采用 BY-NC-SA 协议进行授权 | 数学建模网—SHUMO.COM
转载请注明转自《2010年puzzleup竞赛第1题》
发表评论
only two equilateral triangles with a side parallel
[回复]