组合数学--Set1 hdu-6825
Problem Description
You are given a set S=1..nS={1..n}S=1..n. It guarantees that n is odd. You have to do the following operations until there is only 1 element in the set:
Firstly, delete the smallest element of SSS. Then randomly delete another element f
原创
2020-08-14 09:57:56 ·
109 阅读 ·
0 评论