【Codeforces Round #589 D】Complete Tripartite

题目连接html Complete Tripartite introduce You have a simple undirected graph consisting of \(n\) vertices and \(m\) edges. The graph doesn't contain self-loops, there is at most one edge between a pair o
相关文章
相关标签/搜索