- 博客(2)
- 资源 (3)
- 收藏
- 关注
RSS订阅原创 HDU1083--Courses(二分图最大匹配）
Description Consider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a committee of exactly P stu
2017-06-15 12:57:28
416
原创 HDU3746--Cyclic Nacklace (Kmp)
Description CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there are only 99.9 yuan left. he is too distressed and thinking
2017-06-14 17:54:09
551
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人