codeforces #Round354-div2-B

题目链接

题意：若干个体积为1杯子排成金字塔状，往最上面的杯子注入香槟，每秒流量为1，若该杯子香槟已满则均等地往两侧流下，问t秒后有多少个杯子注满香槟？

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
const double eps=1e-8;
int n;
int sgn(double x)
{
    if(fabs(x)<=eps)
    return 0;
    else
    return x>0?1:-1;
}
double a[15][15];
int main()
{
    int i,j,t;
    int ans;
    while(~scanf("%d%d",&n,&t))
    {
        memset(a,0,sizeof(a));
        ans=0;
        a[1][1]=(double)t;
        for(i=2;i<=n;i++)
        {
            for(j=1;j<=i;j++)
            {
                if(i>1&&i-1>=j&&sgn(a[i-1][j]-1)>=0)//注意越界问题
                a[i][j]+=(a[i-1][j]-1)/2;
                if(i>1&&j>1&&i>=j&&sgn(a[i-1][j-1]-1)>=0)
                a[i][j]+=(a[i-1][j-1]-1)/2;
            }
        }
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=i;j++)
            {
                if(sgn(a[i][j]-1)>=0)
                ans++;
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}