摘要：
https://blog.csdn.net/Ginsn/article/details/81590473 阅读全文
摘要：
https://zouzhongliang.com/index.php/2019/08/03/setjihecounthanshuyunyongshili/ 阅读全文
摘要：
https://www.cnblogs.com/lzhu/p/7010894.html 阅读全文
摘要：
You are given a directed graph with nn vertices and mm directed edges without self-loops or multiple edges. Let's denote the kk-coloring of a digraph 阅读全文
摘要：
https://blog.csdn.net/qq_41713256/article/details/80805338 阅读全文
摘要：
B. Yet Another Crosses Problem time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output B. Yet An 阅读全文
摘要：
You are given three strings ss, tt and pp consisting of lowercase Latin letters. You may perform any number (possibly, zero) operations on these strin 阅读全文