摘要： problem linkhttp://codeforces.com/contest/117/problem/CThis problem needs to find 3-length ring in a type of graph call tournamentOne important precondition of this problem is that :Atournamentis a directed graph without self-loops in which every pair of vertexes is connected by exactly one directed 阅读全文