SRM554 Div2 Easy(250) TheBrickTowerEasyDivTwo
TheBrickTowerEasyDivTwo
赤と青が接しないようにブロックを並べられるのは、個数の差が1個以下の場合。
#include <set> using namespace std; class TheBrickTowerEasyDivTwo{public: int find( int redCount, int redHeight, int blueCount, int blueHeight ) { set<int> S; for ( int r=0; r<=redCount; r++ ) for ( int b=0; b<=blueCount; b++ ) if ( r+b>=1 && abs(r-b)<=1 ) S.insert( r*redHeight + b*blueHeight ); return (int)S.size(); }};