Digital Roulette

John is developing a videogame that allows players to bet in a wall roulette. Players may bet for integer numbers from 0 to N, for some N 0 that represents the maximum number in the roulette.

Of course, the roulette behaves digitally. As a matter of fact, John designed its way to choose a value in the interval 0..N (the result of spinning the roulette) with a digital trigger that moves the roulette with a force that depends on an integer value x randomly chosen in the interval 0..M, where M 0 (M is the maximal appliable force). The roulette turns around a distance equivalent to P(x), where P is a polynomial with integer coefficients. One distance unit represents a displacement of one roulette number, counting clockwise.

It is clear that some result values may be produced by different chosen force values. Also, depending on the mechanism parameters, some numbers in the roulette may be not attainable regardless of the force value. For example, if N = 7, M = 5 and P(x) = x² + 1, the mechanism can generate only three different results:

John wants to know how many different result values may be attained by his mechanism. Can you help him?

Input 

There are several cases to analyze. Each case is described by three lines:

• The first line contains two non-negative integer numbers N and M, separated by a blank ( 1 N 10⁷, 0 M 10⁵).
• The second line contains an integer k, the grad of the polynomial P ( 0 k 10).
• The third line contains k + 1 integers a₀, a₁,..., a_k separated by blanks, indicating the integer coefficients that define the polynomial P, i.e., P(x) = a_kx^k + ^... + a₁x + a₀. You can assume that 0 a_i N for each 0 i k. If k > 0 then you may assume that a_k 0.

The last test case is followed by a line containing two zeros.

Output 

For each case, print one line indicating how many different numbers are attainable by John's mechanism.

Sample Input 

7 5
2
1 0 1
99 10
0
5
99 10
1
5 25
99 10
1
3 29
99 10
2
3 29 31
0 0

Sample Output 

3
1
4
11
10

---

題目描述：

現在有兩個轉盤，根據一套公式使其套用到另一個轉盤，問最多有多少種可能。

題目解法：

窮舉所有可能帶入函數，並且去重複。



#include <stdio.h>
#include <set>
using namespace std;
int ai[15];
int main() {
    int n, m, k;
    int i, j;
    while(scanf("%d %d", &n, &m) == 2 && n+m) {
        scanf("%d", &k);
        for(i = 0; i <= k; i++)
            scanf("%d", &ai[i]);
        set<int> S;
        for(i = 0; i <= m; i++) {
            long long val = 0, x = 1;
            for(j = 0; j <= k; j++) {
                val += ai[j]*x, val %= n+1;
                x = (x*i)%(n+1);
            }
            S.insert(val);
        }
        printf("%d\n", S.size());
    }
    return 0;
}