zoukankan      html  css  js  c++  java
  • B. Pyramid of Glasses

    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Mary has just graduated from one well-known University and is now attending celebration party. Students like to dream of a beautiful life, so they used champagne glasses to construct a small pyramid. The height of the pyramid is n. The top level consists of only 1 glass, that stands on 2 glasses on the second level (counting from the top), then 3 glasses on the third level and so on.The bottom level consists of n glasses.

    Vlad has seen in the movies many times how the champagne beautifully flows from top levels to bottom ones, filling all the glasses simultaneously. So he took a bottle and started to pour it in the glass located at the top of the pyramid.

    Each second, Vlad pours to the top glass the amount of champagne equal to the size of exactly one glass. If the glass is already full, but there is some champagne flowing in it, then it pours over the edge of the glass and is equally distributed over two glasses standing under. If the overflowed glass is at the bottom level, then the champagne pours on the table. For the purpose of this problem we consider that champagne is distributed among pyramid glasses immediately. Vlad is interested in the number of completely full glasses if he stops pouring champagne in t seconds.

    Pictures below illustrate the pyramid consisting of three levels.

    Input

    The only line of the input contains two integers n and t (1 ≤ n ≤ 10, 0 ≤ t ≤ 10 000) — the height of the pyramid and the number of seconds Vlad will be pouring champagne from the bottle.

    Output

    Print the single integer — the number of completely full glasses after t seconds.

    Examples
    input
    3 5
    output
    4
    input
    4 8
    output
    6
    Note

    In the first sample, the glasses full after 5 seconds are: the top glass, both glasses on the second level and the middle glass at the bottom level. Left and right glasses of the bottom level will be half-empty.

    http://codeforces.com/contest/676/problem/B

    #include<iostream>
    #include<cstring>
    #include<algorithm>
    #include<cstdio> 
    #include<queue>
    #include<math.h>
    using namespace std;
    int t,n;
    int x;
    double a[1009][1009];
    int main()
    {
        scanf("%d%d",&n,&t);
        a[1][1]=t;
        for(int  i=1;i<=n;i++)
        {
            for(int j=1;j<=i;j++)    
            if(a[i][j]>=1)    
            {
                 x++;
                 a[i+1][j]+=(a[i][j]-1)/2.0;
                 a[i+1][j+1]+=(a[i][j]-1)/2.0;
            }
        }
        cout<<x;
        return 0;
    }
  • 相关阅读:
    python之read()方法
    python之高阶函数
    python之lambda表达式的应用
    DevExpress.XtraGrid.view.gridview 说明文
    C# SQL时间格式
    GridControl自动定位至符合条件的行
    用sql命令修改数据表
    用C#编程从数据库中读取图片数据导进Excel文件的方法(如何从数据库中读取保存的文件,直接打开,中间不保存到本地)
    DevExpress中GridControl的属性设置及动态绑定数据和全选取消全选
    C# 导出数据到Excel模板中
  • 原文地址:https://www.cnblogs.com/CLGYPYJ/p/7027988.html
Copyright © 2011-2022 走看看