*special problem, binary search, brute force x2868 2095B Plinko *special problem, games, interactive x4958 2095A Piecing It Together *special problem, string suffix structures x11912 2094H La Vaca Saturno Saturnita binary search, brute force, math, number theory 1900 x2564...
*special problem,math x627 2095E Pair Count *special problem,number theory x663 2095D Where Am I? *special problem,geometry x4616 2095C Would It Be Unrated? *special problem,binary search,brute force x2845 2095B Plinko *special problem,games,interactive ...
早上再来分析这道题的时候,已经开始想要改变思路了,但是对于int(1e6)的数据范围的AC自动机中的串的添加删除操作,还是想不出什么好点子。 但是在上午,当我正在YY在Trie树上怎么跳才能让我的串被充分匹配而且不“浪费”字母的时候我又脑补到了一个做法:就是每一个点都记录一下走到这个点可以产生出多少名字(子串)...
水题 然而看不仔细爆int了 c++ View Code py3 View Code 1B 有毒的模拟水题... View Code 1C mdzz。。。 余弦定理求三角形内角,也是圆上的圆周角,乘以2得圆心角 求三圆心角最大公约数得正多边形每一份的圆心角ang,2*pi/ang得出边数n 海伦公式+正弦定理得三角形外接圆半径r = (a * b * c) / ...
qq交流群: 993174634D. Longest Simple Cycle原题指路: https://codeforces.com/problemset/problem/1476/D题意 (2\ \mathrm{s})有编号 0 \sim n 的 (n + 1) 个节点, 有编号 1 \sim n 的 n 条边, 其中 i\ \ (1 \le…
https://codeforces.com/problemset/problem/140/E) E. New Year Garland time limit per test 5 seconds memory limit per test 256 megabytes input standard input output standard output As Gerald, Alexander, Sergey and Gennady are already busy with the usual New Year chores, Edward hastily decorates...
qq交流群:993174634 题单: https://codeforces.com/problemset?tags=probabilities,0-16009A. Die Roll题意三个人丢写着数字 1\sim 6的六面骰子,其中前两人得到的数字分别为a,b\ \ (1\leq a,b\leq b).若第三个人得…
https://codeforces.com/problemset?order=BY_SOLVED_DESC&tags=constructive+algorithms%2C1700-1900 通过大量的构造题训练,提高观察能力,快速找到切题入口。具体见我在知乎上的这篇回答。 见识更高的山、更广的海。 按人数从高到低,做 2200+ 的题目。建议不设置难度上限!由于按人数排序,难度分不会太高,不设上...
The clique problem is one of the most well-known NP-complete problems. Under some simplification it can be formulated as follows. Consider an undirected graph G. It is required to find a subset of vertices C of the maximum size such that any two of them are connected by an edge in grap...
https://codeforces.com/problemset?order=BY_SOLVED_DESC&tags=constructive+algorithms%2C1700-1900 通过大量的构造题训练,提高观察能力,快速找到切题入口。具体见我在知乎上的这篇回答。 见识更高的山、更广的海。 按人数从高到低,做 2200+ 的题目。建议不设置难度上限!由于按人数排序,难度分不会太高,不设上...