What is the approach for solving JAKKU when the number of satellites are more than 3 ?
Take any pair of satellites (A and B) at a given time t.The two horizons of visibility of each satellite are great circles that intersect in two points. Look at how many satellites different from A and B “see”
these points. The cost of this is n^3 where n is the number of satellites. Look at the minimum number. This will be the number of satellites that you need to remove to have a gap at time t. Now you do this for fine enough partition of t and you get the desired global minimum.
When will codechef publish the editorials for FEB17 ?