随笔分类 - CF做题记
Anadi and Domino（转）
摘要：（转自）https://www.cnblogs.com/2462478392Lee/p/11578390.html 感谢Ldler 题意：每条边可以加一个多米诺骨牌，但边连接着同一个节点时骨牌对应一边的数字也得相同，求最大可放置骨牌数。 在每个节点写入1-6的数（节点的值和数并不重要），那么66，1
Codeforces Round #578 (Div. 2) D. White Lines
摘要：D. White Lines 传送门 time limit per test 1.5 seconds memory limit per test 256 megabytes input standard input output standard output Gildong has bought
Codeforces Round #576 (Div. 2) D. Welfare State||Codeforces Round #576 (Div. 1) B Welfare State
摘要：Welfare State time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output There is a country with n
Codeforces Round #576 (Div. 2) C. MP3
摘要：C. MP3 原题地址 time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output C. MP3 原题地址 time limit per te
D2. RGB Substring (hard version)||D1. RGB Substring (easy version)
摘要：D2. RGB Substring (hard version) 原题传送门 time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output D
