Div2 Easy: BunnyPuzzle うさぎが条件を満たしつつ移動できる場合の数を求める問題。 class BunnyPuzzle { public: int theCount(vector <int> bunnies) { int n = bunnies.size(); int result = 0; for (int i = 0; i < n; ++i) { for (int j = i-1; j >= 0; --j</int>…