POJ 1091 (Tolerant principle)

POJ 1091 (tolerant principle)
Test Instructions:
The sum of X1,..., xn that satisfies the greatest common divisor (x1,x2,..., xn,m) =1 is given for N and M, which must satisfy 0 <= x1,x2,..., xn <= m.
Limitations:
n <=, M <= 100000000
ideas:
principle of tolerance and repulsion
There are two ways to tolerate this.
1. Enumerate the factors of M to allow
2. Enumeration of greatest common divisor (x1,x2,..., xn,m) contains a mass factor to tolerate
Here's the second way.

POJ 1091 (Tolerant principle)