By a refinement of a rank argument used to prove a directed version of the Graham-Pollak theorem, we show that n bicliques are needed to partition the arc-set of the complement of a directed cycle.
