zoukankan      html  css  js  c++  java
  • ZOJ Problem Set–1216 Deck

    Time Limit: 2 Seconds      Memory Limit: 65536 KB


    Scenario

    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

    #include<iostream>
    
    #include<iomanip>
    
    using namespace std;
    
    int main()
    
    {
    
      double *d = new double[99999];
    
      for(int i = 1; i <= 99999; i++)
    
      {
    
        *(d + i) = 1/(i*2.0);
    
      }
    
      cout<<"# Cards  Overhang"<<endl;
    
      int n;
    
      while(cin>>n)
    
      {
    
        double length = 0;
    
        for(int j = 1; j <= n; j++)
    
          length += *(d + j);
    
        cout<<setiosflags(ios::right)<<setw(5)<<n<<"     "<<fixed<<setprecision(3)<<length<<endl;
    
      }
    
      return 0;
    
    }
  • 相关阅读:
    远程桌面连接偶尔无法连接的解决方案
    事物复制遇到的几个错误
    几条关于查看和删除发布和分发的命令
    Winform- TreeView的使用例子
    Winform- 界面开发之布局控件"WeifenLuo.WinFormsUI.Docking"的使用
    Winform- IrisSkin.dll轻松实现窗体换肤功能
    Oracle- 备份单表结构和单表数据
    MSSQLSERVER数据库- 作业调度定时备份数据库
    Oracle- plsql developer如何查询SQL语句执行历史记录
    MSSQLSERVER数据库- SQL删除重复数据的五种方式
  • 原文地址:https://www.cnblogs.com/malloc/p/2419708.html
Copyright © 2011-2022 走看看