Pyramid of Glasses（模拟）

Problem:
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.

本来我是用的递归方法做的，想着有点像二叉树，就从上到下，每一秒初始化flow=1，每次递归先将目前这个酒杯看能不能塞满，然后再对左下角的酒杯和右下角的酒杯递归，等flow=0了就返回了。但好像有点问题emem，现在脑子也没那么清醒，然后也没想清问题出在哪里。

于是借鉴了别人的思路，发现可以更简单。
方法如下：
一个酒杯的容量为1，要持续倒t秒，就直接令cham[1][1]=t，接下来对后面所有的酒杯一一遍历，对于每一个酒杯cham[i][j]来说，只可能来自cham[i-1][j-1]和cham[i-1][j]（当然有些边缘的酒杯，只能来自一个，所以我加了一些限定条件要判断这个酒杯是不是只有一个源头），我们只要看这些可能的源头的值是不是大于1，如果大于1，就表示肯定会把溢出的一半给cham[i][j]，这样下来，就可以确定每个酒杯里面有多少酒。当然，最后判断的时候不是cham[i][j]==1就是满了，而是cham[i][j]>=1。

代码:

#include<stdio.h>
int main(void){
	int n,t,i,j,cout = 0;
	double cham[11][11] = {0};
	scanf("%d %d",&n,&t);
	cham[1][1] = t;
	for(i=2;i<=n;i++){
		for(j=1;j<=i;j++){
			if(j != 1 && cham[i-1][j-1] > 1){
				cham[i][j] += (cham[i-1][j-1] - 1)/2;
			}
			if(i != j && cham[i-1][j] > 1){
				cham[i][j] += (cham[i-1][j] - 1)/2;
			}
		}
	}
	for(i=1;i<=n;i++){
		for(j=1;j<=i;j++){
			if(cham[i][j] >= 1) cout++;
		}
	}
	printf("%d\n",cout);
	return 0;
}