Codeforce#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[][],eps=1e-,p;int n,k,ans;

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

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