北大百炼1003 Hangover 题解

最新推荐文章于 2020-08-31 17:51:56 发布

Sherry1996

最新推荐文章于 2020-08-31 17:51:56 发布

阅读量648

点赞数

分类专栏：基础文章标签：北大百炼 c语言 ACM 1003

本文链接：https://blog.csdn.net/yuxuedashen/article/details/46640265

版权

博客详细解析了北大百炼算法竞赛中的1003题——Hangover。内容包括问题描述，即如何计算能摆放的卡片张数，给定卡片长度求解n的算法问题。文中提供了通过（AC）的C语言代码实现。

摘要由CSDN通过智能技术生成

1003:Hangover

总时间限制:

1000ms

内存限制:

65536kB

描述

How far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length. (We're assuming that the cards must be perpendicular to the table.) With two cards you can make the top card overhang the bottom one by half a card length, and the bottom one overhang the table by a third of a card length, for a total maximum overhang of 1/2 + 1/3 =