B. Pyramid of Glasses

原题链接
B. Pyramid of Glasses

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.
大致题意
有n层高的杯子，每秒钟从顶部倒一杯水下来，问经过t秒，有多少个杯子的水满了。
思路
很有趣的模拟题。首先考虑把每个杯子看成‘1’，然后将每个杯子写进double类型的二维数组中，如果杯子满了，则将溢出的分成相等的两份然后分别流进下层对应的两个杯子中，同时对满了的杯子计数。
AC代码

#include<iostream>
using namespace std;
double v[15][15];
void pour(int n)
{
    v[1][1]+=1;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=i;j++)
        {
            if(v[i][j]<=1) continue;
            double p=v[i][j]-1;
            v[i][j]=1;
            v[i+1][j]+=p/2;
            v[i+1][j+1]+=p/2;
        }
}
int main(void)
{
    int n,t;
    cin>>n>>t;
    for(int i=1;i<=t;i++)
        pour(n);
    int full=0;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=i;j++)
        {
            if(v[i][j]>0.9999)
            full++;
        }
    cout<<full<<endl;
    return 0;
}

如有疑问欢迎私信！！

转载于:https://www.cnblogs.com/flyawayl/p/8305617.html