676B - Pyramid of Glasses - CodeForces Solution

n,t=map(int,input().split())
ans,b=0,1<<n
a=[[0]*11 for i in range(11)]
a[0][0]=t*(1<<n)
for i in range(n):
  for j in range(i+1):
    if a[i][j]>=b: a[i+1][j]+=(a[i][j]-b)//2; a[i+1][j+1]+=(a[i][j]-b)//2; ans+=1
print(ans)