CF985G Team Players
题目描述
### 题目大意
有 $n$ 个点和 $m$ 条边，点编号依次为 $0,1,\cdots, n-1$。
如果一个点的三元组 $(i,j,k)~(i
输入格式
无
输出格式
无
说明/提示
In the first example all $ 4 $ teams are valid, i.e. triples: {0, 1, 2}, {0, 1, 3}, {0, 2, 3} {1, 2, 3}.
In the second example teams are following: {0, 2, 3}, {1, 2, 3}.
In the third example teams are following: {0, 1, 2}, {0, 1, 4}, {0, 1, 5}, {0, 2, 4}, {0, 2, 5}, {1, 2, 3}, {1, 2, 4}, {1, 2, 5}.