- 博客(6)
- 收藏
- 关注
RSS订阅原创 2018-焦作网络赛 Mathematical Curse （dp）细节比较多
A prince of the Science Continent was imprisoned in a castle because of his contempt for mathematics when he was young, and was entangled in some mathematical curses. He studied hard until he reached ...
2018-09-20 23:37:08
245
原创 C - How Many Tables HDU - 1213（并查集）
Today is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends know each other, a...
2018-09-14 18:35:20
220
原创 B - The Suspects POJ - 1611(裸的并查集）
Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best strategy is to s...
2018-09-14 16:16:13
331
原创 A - Wireless Network POJ - 2236（并查集）
An earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected aftershock attacked, all computers in the n...
2018-09-13 19:52:14
218
原创 A - Max Sum Plus Plus
Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced with a more difficult problem. Given ...
2018-09-09 23:32:51
181
原创 哈密顿绕行世界问题(dfs)
一个规则的实心十二面体，它的 20个顶点标出世界著名的20个城市，你从一个城市出发经过每个城市刚好一次后回到出发的城市。 Input 前20行的第i行有3个数,表示与第i个城市相邻的3个城市.第20行以后每行有1个数m,m<=20,m>=1.m=0退出. Output 输出从第m个城市出发经过每个城市1次又回到m的所有路线,如有多条路线,按字典序输出,每行1条路线.每行首先输出...
2018-09-02 20:28:23
188
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人