A complete bipartite graph is a simple bipartite with bipartition (X,Y) if each vertex in X is connected with each vertex in Y. A complete bipartite graph is denoted as Km,n if |X|=m and |Y|=n.This paper addresses the oriented graphs of Km,n, and proves that there exist two nonnegative integers s and t satisfying the equations s+t=2n and as+bt=n2 if the indegree of each vertex in an oriented graph of Kn,nis a or b (a and b are two nonnegative integers). Moreover, there exists an oriented graph of Kn,nthat makes the indegree of each vertex to be either a or b for the nonnegative integers a, b and n satisfying some special conditions.