 想请教一个简单的C语言的算法问题，具体如下：

Problem Description
In 3201, The humans have conquered the whole universe.
During the conquest ,we found lots of magical phenomena overthrown our previous cognition.
For example, the Eloh is a hole like the black hole but has its own property. And if something is around the Eloh, there is a force between them, named “EF”(Eloh Force).
Every Eloh has a circle area around it, and the Eloh is the center of the circle area.
The circle is called “EFL” (Eloh Force Line).
If there is a thing that has the mass(m) and the volume(v), the EF will satisfy the following properties:
1. In the EFL, EF = v / m and the force performs as the gravitational force.
2. Out the EFL, EF = m / v and the force performs as the repulsion force
One day, Farmer John was grazing his robot cows in the universe. The number of cows is N and every cow has its own mass(mi) and volume(vi).
Suddenly, he encountered such an Eloh. At first he and his cows are in the EFL.
Sadly, the Eloh is swept away some of his cows that stressed the most powerful EF from the Eloh. In other words, sort all the cows’EF from large to small and choose some cows from the front to the back. Luckily, he and the rest of cows escaped to the external of the EFL. To leave the Eloh quickly, he put the reminding cows packaged as a connecting body, i.e, the overall performance of the mass M = sum(mi) (the cow[i] is not swept by the Eloh) and the volume V = sum(vi) (like the previous). Because of the panic, he don’t know exactly how many cows were swept away, just know that not all been swept away, nor is the zero.
As a magical uncle grazing in the universe, Farmer John can create a wormhole through the Eloh center and the outside world. Farmer John can exchange some pair of the cows(pick some cows in the Eloh and choose the same number of cows outside the cave). The connecting body’s M and V will calculator again after exchanging.
Now, Farmer John would like to know when how many cows were swept away in the beginning, there is an exchange scheme can make his EF bigger.
To ensure that no two cows have the same density(m/v).Input
There are multiple test cases.
The first line of the case contains a number N(0 < N <= 200000)
The following N lines, each of two number mi and vi.(0 < mi,vi <= 100000), the sequence will be in density ascending order.
The input is terminated by a line containing 0.Output
For each case of input, the output should consist of one line giving the number Q of the exchange schemes, following Q lines that contain a number K meaning if in the beginning, there are K cows swept away, Farmer John can find an exchange program to help him. Of course, you should output them from small to big.Sample Input
5
1 3
3 8
4 10
1 2
5 9
0Sample Output
2
1
2
编辑于：2017.11.25 23:54