## Problem Statement

You have a lot of cards. If you pick out a card with number x[i],card with number x[i]-1 and card with number x[i]+1 will also be picked out too. Determine the maxinum steps to pick out all the cards.

## Problem Statement

Please calculate the minimum number x which is larger than n and has consecutive k '1's in the binary representation.

## Problem Statement

You have some boxes to buy, which contains red&blue candies. A box i contains a[i] red candies and b[i] blue candies as labeled. however it can also contains a[i]-1 red candies with b[i]+1 blue candies or a[i]+1 red candies with b[i]-1 blue candies. You want to buy as cheap set of boxes as possible which contains at least K candies with same color.

## hihoCoder 编程练习赛43

(P.S.因为特殊原因我T3代码可以发粗来啦qwq)

### 板块

本站托管于学园都市
由御坂网络提供CDN加速服务