CF#354_B_Pyramid of Glasses(模拟)

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

题意：给你一个N层的杯子堆成的金字塔，倒k个杯子的酒，问倒完后有多少个杯子的酒是满的

题解：由于数据不是很大，直接模拟就行了

#include<cstdio>
#include<cstring>
#define F(i,a,b) for(int i=a;i<=b;++i)

double a[15][15],eps=1e-9,p;int n,k,ans;

void fuck(){
	a[1][1]+=1;
	F(i,1,n-1)F(j,1,i)
	if(a[i][j]-1>eps)p=a[i][j]-1,a[i][j]=1,a[i+1][j]+=p/2,a[i+1][j+1]+=p/2;
}

int main(){
	while(~scanf("%d%d",&n,&k)){
		memset(a,0,sizeof(a));
		F(i,1,k)fuck();ans=0;
		F(i,1,n)F(j,1,i)if(a[i][j]>1-eps)ans++;
		printf("%d\n",ans);
	}
	return 0;
}