CMIMC 2017 Computer Science Problem 4

[system]

How many complete directed graphs with vertex set V=\{1,2,3,4,5,6\} contain no 3 -cycles?