Brap Lesh Mafia

View as PDF

Submit solution

Points: 5
Time limit: 1.0s
Memory limit: 16M

Problem type
PEG Test - Halloween 2014

The Brap Lesh Mafia is an organization that collects candy from unsuspecting neighborhoods during Halloween.

There are N houses that the Brap Lesh Mafia will target on Halloween. The i-th house will give out a_{i} units of candy each time it receives a visitor, and will be visited b_{i} times by members of the Brap Lesh Mafia.

There are K members in the Brap Lesh Mafia. At the end of the day, the total amount of candy is divided evenly amongst its members such that each member receives the same amount of candy as any other member, and each member receives as much candy as possible. The leftover candy is fed to their pet dog, Rex.

Determine the amount of candy Rex will receive.

Input Specification

The first line of input will contain the integers: N, K (1 \le N
\le 10\,000; 1 \le K \le 1\,000\,000\,009).
N lines of input will follow. The i-th of these lines will contain values a_{i} and b_{i} (0 \le a_{i} \le 10^{9}, 0 \le b_{i} \le
10^{9}) of house i (for 1 \le i \le N).

Output Specification

Output a single integer, the number of units of candy that Rex will receive.

Sample Input 1

4 12
1 4
2 9
3 8
5 5

Sample Output 1


Explanation 1

Brap Lesh Mafia collects 71 candies total. Split amongst 12, there are 11 candies left over for Rex.

Sample Input 2

1 1000000007
1000000000 1000000000

Sample Output 2



There are no comments at the moment.