CodeForces 1183D. Candy Box (easy version)

This problem is actually a subproblem of problem G from the same contest.c++ There are nn candies in a candy box. The type of the ii-th candy is aiai (1≤ai≤n).數組 You have to prepare a gift using some
相關文章
相關標籤/搜索