2016年8月30日
Codeforces Round #369 (Div. 2) D. Directed Roads dfs求某个联通块的在环上的点的数量
摘要： D. Directed Roads D. Directed Roads ZS the Coder and Chris the Baboon has explored Udayland for quite some time. They realize that it consists of n to 阅读全文
posted @ 2016-08-30 17:07 meekyan 阅读(258) 评论(0) 推荐(0)
Codeforces Round #369 (Div. 2) C. Coloring Trees DP
摘要： C. Coloring Trees ZS the Coder and Chris the Baboon has arrived at Udayland! They walked in the park where n trees grow. They decided to be naughty an 阅读全文
posted @ 2016-08-30 10:56 meekyan 阅读(299) 评论(0) 推荐(0)