随笔分类 -  CF

632C. The Smallest String Concatenation（注意 ：stl sort函数坑点--- coredump问题 ）
摘要：链接：http://codeforces.com/problemset/problem/632/C 思路：思路很快想到了，但是被sort坑了，对于sort的自定义比较函数，记住 对于相等的值一定要返回flase 附上别的大佬的验证：https://blog.csdn.net/xhu_eternalc 阅读全文
posted @ 2019-06-04 23:06 进击的黑仔 阅读(264) 评论(0) 推荐(0)
B. Nirvana Codeforces Round #549 (Div. 2) （递归dfs）
摘要：恢复内容开始 Kurt reaches nirvana when he finds the product of all the digits of some positive integer. Greater value of the product makes the nirvana deepe 阅读全文
posted @ 2019-04-11 00:36 进击的黑仔 阅读(135) 评论(0) 推荐(0)
C. Queen Codeforces Round #549 (Div. 2) （搜索）
摘要：恢复内容开始 You are given a rooted tree with vertices numerated from 11 to nn . A tree is a connected graph without cycles. A rooted tree has a special ver 阅读全文
posted @ 2019-04-11 00:15 进击的黑仔 阅读(672) 评论(0) 推荐(0)
L - Ray in the tube Gym - 101911L （暴力）
摘要：恢复内容开始 You are given a tube which is reflective inside represented as two non-coinciding, but parallel to OxOx lines. Each line has some special integ 阅读全文
posted @ 2019-03-22 20:41 进击的黑仔 阅读(12597) 评论(0) 推荐(0)
B - Glider Gym - 101911B（二分）
摘要：output standard output output A plane is flying at a constant height of hh meters above the ground surface. Let's consider that it is flying from the 阅读全文
posted @ 2019-03-19 19:54 进击的黑仔 阅读(272) 评论(0) 推荐(0)
Masquerade strikes back Gym - 101911D （数学）
摘要：Quite often the jury of Saratov SU use the problem "Masquerade" in different practice sessions before the contest. This problem is quite easy — all yo 阅读全文
posted @ 2019-03-19 16:56 进击的黑仔 阅读(567) 评论(0) 推荐(0)
Painting the Fence Gym - 101911E（构造）
摘要：There is a beautiful fence near Monocarp's house. The fence consists of nn planks numbered from left to right. The ii -th plank has color aiai . Monoc 阅读全文
posted @ 2019-03-19 16:45 进击的黑仔 阅读(324) 评论(0) 推荐(0)
Tree Reconstruction Gym - 101911G（构造）
摘要：恢复内容开始 Monocarp has drawn a tree (an undirected connected acyclic graph) and then has given each vertex an index. All indices are distinct numbers fro 阅读全文
posted @ 2019-03-19 16:31 进击的黑仔 阅读(361) 评论(0) 推荐(0)
Petya and Array CodeForces - 1042D （树状数组）
摘要：D. Petya and Array time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Petya has an array aa 阅读全文
posted @ 2018-10-08 14:08 进击的黑仔 阅读(498) 评论(0) 推荐(0)
CodeForces - 1051D-Bicolorings (DP)
摘要：odeforces 1051 D. Bicolorings (DP) D. Bicolorings time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standa 阅读全文
posted @ 2018-10-08 08:39 进击的黑仔 阅读(402) 评论(0) 推荐(0)
C. A Mist of Florescence ----- Codeforces Round #487 (Div. 2)
摘要：C. A Mist of Florescence time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output As the boat drif 阅读全文
posted @ 2018-06-14 14:06 进击的黑仔 阅读(235) 评论(0) 推荐(0)