CLIQSEP - Clique Separation
Let G be the set of di-graphs with n nodes, m edges and maximum clique (complete subgraph) size of k nodes, determine whether it is possible to divide every element of G into two disjoint sets of nodes, such that the largest size of a clique contained in one set is equal to the largest size of a clique contained in the other set.
Each line of input has n <= 1000 , m <= 1000000 , k <= n , listed in that order.
For each line of input, output "yes" if it is possible, "no" if it is not possible.
10 99 8 9 80 3
Problemsetter --- Chen, Xiaohong