关闭

Codeforces Round #354 (Div. 2)B.Pyramid of Glasses(思维题)

标签: C++codeforces
285人阅读 评论(0) 收藏 举报
分类:

题目链接:http://codeforces.com/contest/676/problem/B


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.



大致题意:被子像图那样堆起来,第一层一个杯子,第二层两个杯子,然后以此类推,然后从最上面倒酒,倒一秒钟的酒正好是一个杯子的容量,问n层杯子倒t秒钟会有几个杯子满了。

大致思路:不用想太复杂,倒的酒的数量是一定的,所以从最上面开始推,下面酒的数量跟上面酒流出来的数量是一样的,然后一杯酒流出来的数量会分成两部分,这也就有点像杨辉三角,下面的杯子是上面两个杯子流出来数量和的一半


直接看代码吧:

#include <bits/stdc++.h>
using namespace std;
double temp[200][200];
int main()
{
    int n,t;
    while (~scanf("%d%d",&n,&t))
    {
        int res = 0;
        memset(temp,0,sizeof(temp));
        for (int i = 0 ; i < n ; i++ )
        {
            for (int j = 0 ; j <= i ; j++ )
            {
                if (i == 0)
                {
                    temp[i][j] = t * 1.0;
                    if(temp[i][j] >= 1.0)  //最上层的杯子,如果大于等于1 那么就说明杯子满了
                    {
                        res++;
                    }

                }
                else 
                {
                    if (j == 0)
                    {
                        if(temp[i-1][j] >= 1)  //判断上面的杯子有没有溢出
                            temp[i][j] = (temp[i - 1][j] - 1) * 1.0/ 2;
                        if (temp[i][j] >= 1.0)
                        {
                            res ++;
                        }
                    }
                    else 
                    {
                        if(j  <= i - 1)
                        {
                            if (temp[i-1][j-1] >= 1 && temp[i-1][j] >= 1)   //因为这个杯子会接收到两个杯子溢出
                                temp[i][j] = (temp[i - 1][j-1] + temp[i-1][j] - 2) * 1.0 / 2;  //因为溢出会分成两个部分,所以除2
                            else if(temp[i-1][j-1] >= 1) 
                            {
                                temp[i][j] = (temp[i-1][j-1] - 1) / 2;
                            }
                            else 
                            {
                                temp[i][j] = (temp[i-1][j] - 1) /2;
                            }
                            if(temp[i][j] >= 1.0)
                            {
                                res++;
                            }
                        }
                        else 
                        {
                            if (temp[i-1][j-1] >= 1)
                                temp[i][j] = (temp[i-1][j-1] - 1) * 1.0/ 2;
                            if(temp[i][j] >= 1.0)
                            {
                                res++;
                            }
                        }
                    }
                }
            }
        }
        printf("%d\n",res);
    }
    return 0;
}


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:11143次
    • 积分:551
    • 等级:
    • 排名:千里之外
    • 原创:46篇
    • 转载:0篇
    • 译文:0篇
    • 评论:1条
    文章分类