UVA - 1635 Irrelevant Elements

题目传送门

#include <iostream>
#include <stdio.h>
#include <string>
#include <string.h>
#include <algorithm>
#define MAXN 110
using namespace std;
int fac[MAXN][2];
int fac_c[MAXN];
int ans[110000];
void factor(int m)
{//质因数分解
	int& coun = fac[0][0];
	coun = 1;

	for (int i = 2; i*i <= m; i++)
	{
		if (m%i == 0)
		{
			while (m%i == 0) { fac[coun][1]++; m /= i; }
			fac[coun++][0] = i;
		}
	}
	if (m > 1) { fac[coun][0] = m; fac[coun][1]++; coun++; }
}
bool check(int n, int j)
{
	int coun = fac[0][0];
	int a = n - j;
	int b = j;

	for (int i = 1; i < coun; i++)
	{
		int p = fac[i][0];
		while (a%p == 0) { a /= p; fac_c[i]++; }
		while (b%p == 0) { b /= p; fac_c[i]--; }
	}//根据唯一分解定理来判读系数是否为m的倍数
	for (int i = 1; i < coun; i++)if (fac[i][1] > fac_c[i])return false;
	return true;
}
int main(void)
{
	int n, m;

	while (scanf("%d%d", &n, &m) != EOF)
	{
		int cnt = 0;

		memset(fac, 0, sizeof(fac));
		memset(fac_c, 0, sizeof(fac_c));
		factor(m);
		for (int i = 1; i < n; i++)if (check(n, i))ans[cnt++] = i + 1;
		printf("%d\n", cnt);
		if (cnt)printf("%d", ans[0]);
		for (int i = 1; i < cnt; i++)printf(" %d", ans[i]);
		putchar('\n');
	}

	return 0;
}