2017-2018 ACM-ICPC, Asia Tsukuba Regional Contest(部分题解)
传送门2017-2018ACM-ICPC日本筑波区域赛ProblemA:SecretofChocolatePoles思路:简单dp。d[i][0/1]d[i][0/1]d[i][0/1]表示高度为i时,顶层圆盘是0/1颜色时的方案数。#includeusingnamespacestd;typedeflonglongll;lld[110][2];intmain(){intn,k;cin>>n>>k;