UVA 1635 Irrelevant Elements——组合数+唯一分解定理

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
const int maxn = 1e5+10;
int n, m, num, prime[110][2], a[maxn], b[110];
void fenjie() {
    for(int i = 2; i*i <= m; i++) {
        if(m % i == 0) {
            prime[++num][0] = i;
            prime[num][1] = 1;
            m /= i;
            while (m % i == 0) {
                prime[num][1]++;
                m /= i;
            }
        }
    }
    if(m > 1) {
        prime[++num][0] = m;
        prime[num][1] = 1;
    }
}
bool check(int i) {
    int x = n - i, y = i;
    for(int i = 1; i <= num; i++) {
        int p = prime[i][0];
        while(x % p == 0) {
            x /= p;
            b[i]++;
        }
        while(y % p == 0) {
            y /= p;
            b[i]--;
        }
    }
    for(int i = 1; i <= num; i++) if (b[i] < prime[i][1]) return false;
    return true;
}

int main() {
    //freopen("out.txt", "w", stdout);
    while(~scanf("%d %d", &n, &m)) {
        num = 0;
        fenjie();
        memset(b, 0, sizeof(b));
        int cnt = 0;
        for(int i = 1; i < n-1; i++) if (check(i)) a[++cnt] = i + 1;
        printf("%d\n", cnt);
        for (int i = 1; i <= cnt; i++) {
            if (i != 1) printf(" ");
            printf("%d", a[i]);
        }
        printf("\n");
    }
    return 0;
}