HBC17379Thinking-Bear magic题解

冷夕颜 算法基础篇 48 0
想要成为编程高手?那就来试试全网最全C++题库,让您在练习中快速成长。
In order to become a magical girl, Thinking-Bear are learning magic circle. He first drew a regular polygon of N sides, and the length of each side is a. He want to get a regular polygon of N sides, and the polygon area is no more than L. He doesn't want to draw a new regular polygon as it takes too much effort. So he think a good idea, connect the midpoint of each edge and get a new regular polygon of N sides. How many operations does it need to get the polygon he want?

In order to become a magical girl, Thinking-Bear are learning magic circle. He first drew a regular polygon of N sides, and the length of each side is a. He want to get a regular polygon of N sides, and the polygon area is no more than L. He doesn't want to draw a new regular polygon as it takes too much effort. So he think a good idea, connect the midpoint of each edge and get a new regular polygon of N sides. How many operations does it need to get the polygon he want?

HBC17379Thinking-Bear magic题解
-第1张图片-东莞河马信息技术
(图片来源网络,侵删)
想要在职场中立于不败之地?那就来试试全网最全C++题库,让您在练习中快速提升技能。

标签: HBC17379Thinking-Bear magic题解