逆元
尒轩窗
这个作者很懒,什么都没留下…
展开
-
Generation I
链接:https://www.nowcoder.com/acm/contest/144/C 题目描述Oak is given N empty and non-repeatable sets which are numbered from 1 to N.Now Oak is going to do N operations. In the i-th operation, he will ...原创 2018-08-05 18:23:30 · 212 阅读 · 2 评论 -
2016 ACM/ICPC 大连区域赛 F—Detachment【贪心+逆元】
http://acm.hdu.edu.cn/contests/contest_showproblem.php?pid=1006&cid=736DetachmentTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 346 ...原创 2018-10-03 18:41:25 · 451 阅读 · 0 评论