HDU1330 Deck
来源:互联网 发布:mysql 1267 编辑:程序博客网 时间:2024/06/08 19:01
1330
Deck
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2025 Accepted Submission(s): 1190
Problem Description
A single playing card can be placed on a table, carefully, so that the short edges of the card are parallel to the table’s edge, and half the length of the card hangs over the edge of the table. If the card hung any further out, with its center of gravity off the table, it would fall off the table and flutter to the floor. The same reasoning applies if the card were placed on another card, rather than on a table.
Two playing cards can be arranged, carefully, with short edges parallel to table edges, to extend 3/4 of a card length beyond the edge of the table. The top card hangs half a card length past the edge of the bottom card. The bottom card hangs with only 1/4 of its length past the table’s edge. The center of gravity of the two cards combined lies just over the edge of the table.
Three playing cards can be arranged, with short edges parallel to table edges, and each card touching at most one other card, to extend 11/12 of a card length beyond the edge of the table. The top two cards extend 3/4 of a card length beyond the edge of the bottom card, and the bottom card extends only 1/6 over the table’s edge; the center of gravity of the three cards lines over the edges of the table.
If you keep stacking cards so that the edges are aligned and every card has at most one card above it and one below it, how far out can 4 cards extend over the table’s edge? Or 52 cards? Or 1000 cards? Or 99999?
Input
Input contains several nonnegative integers, one to a line. No integer exceeds 99999.
Output
The standard output will contain, on successful completion of the program, a heading:
# Cards Overhang
(that’s two spaces between the words) and, following, a line for each input integer giving the length of the longest overhang achievable with the given number of cards, measured in cardlengths, and rounded to the nearest thousandth. The length must be expressed with at least one digit before the decimal point and exactly three digits after it. The number of cards is right-justified in column 5, and the decimal points for the lengths lie in column 12.
Sample Input
1
2
3
4
30
Sample Output
The line of digits is intended to guide you in proper output alignment, and is not part of the output that your solution should produce.
12345678901234567
# Cards Overhang
1 0.500
2 0.750
3 0.917
4 1.042
30 1.997
Source
South Central USA 1998
Recommend
Ignatius.L | We have carefully selected several similar problems for you: 1320 1322 1124 1221 1155
叠卡片,也就是计算1/2+1/4+…+1/2*n的和
#include<cstdio>int main(){ int n; printf("# Cards Overhang\n"); while (scanf("%d",&n)!=EOF) { double num = 0; for (int i = 1; i <= n; i++) num += 1.0 / (2 * i); printf("%5d%10.3lf\n", n, num); } return 0;}
- HDU1330 Deck
- hdu1330
- hdu1330
- Deck
- Deck
- HDU1330-Nearest Common Ancestors
- zoj1216 Deck
- Deck JS: HTML5 幻灯片
- zoj 1216 Deck
- HDU 1330 Deck
- ZOJ 1216 Deck
- HOJ 1331 Deck
- zoj 1216 Deck
- ZOJ 1216 Deck
- D2: deck of cards
- hdu 1330 Deck
- UVa651 - Deck(预处理)
- UVa 651 - Deck
- intersection set
- Maven 简单使用创建Web项目
- pyhton爬虫(11)——抓取亚马逊商品类别信息
- 使用drawBitmap绘制图片
- 应届生落户上海申请及办理流程
- HDU1330 Deck
- RocketMQ简介
- tipso插件---消息提示框
- Java线程、并发概念整理
- ios 图片放大缩小动画效果
- springboot学习-全局异常处理
- Linux netstat命令详解
- 快速的取整方法(~~)
- ZXing优化