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;
    
    }
  • 相关阅读:
    20191028 Codeforces Round #534 (Div. 1)
    20191028 牛客网CSP-S Round2019-1
    UVA11464 Even Parity 搜索+递推
    CSP2019-S1 游记
    LG2921 [USACO2008DEC]Trick or Treat on the Farm 内向基环树
    bzoj 2002 Bounce 弹飞绵羊
    快速乘,快速幂,十进制快速幂,矩阵快速幂
    2019牛客暑期多校训练营(第五场) generator 1
    2019牛客暑期多校训练营(第五场) digits 2
    hdu 4714 Tree2cycle
  • 原文地址:https://www.cnblogs.com/malloc/p/2419708.html
Copyright © 2011-2022 走看看