题意:对于给定的n个数a1,a2,...an,依次求出相邻两数之和,将得到一个新数列。重复上述操作时,最后结果将变成一个数。问这个数除以m的余数与那些数无关?
思路:1.在一般情况下,最后ai的系数是C(i - 1,n - 1)。这样问题就变成了C(0,n -1),C(1,n - 1),...C(n -1 ,n - 1)那些是m的倍数,可以用C(n,k) = C(k - 1,n) * (n - k + 1) / k来递推
2.由于n<=1e5,数据范围过大1,因此我们可用唯一分解因式分解将m分解成素数,fac[i]记录了m分解成的素数,num_m[i]表示fac[i]有几个,对于C(i - 1,n - 1)求出对于m分解成的所有素数有几个num_c[i],只有分解成的所有素数num_c[i]>=num_m[i],该项无关
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define INF 0x3f3f3f3f
#define mod 1000000007;
using namespace std;
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
const int maxn = 1e5 + 2;
int n,m,cnt,sum,ans[maxn];
int fac[maxn],num_m[maxn],num_c[maxn];
void init()
{
cnt = 0;
int tmp = m;
memset(num_m,0,sizeof(num_m));
memset(num_c,0,sizeof(num_c));
for(int i = 2;i * i <= tmp;i++)
{
if(tmp % i == 0)
{
fac[++cnt] = i;
while(tmp % i == 0)
{
tmp /= i;
num_m[cnt]++;
}
}
}
if(tmp > 1) fac[++cnt] = tmp,num_m[cnt]++;
}
int test(int x)
{
int a = n - x;
int b = x;
for(int i = 1;i <= cnt;i++)
{
while(a % fac[i] == 0) a /= fac[i],num_c[i]++;
while(b % fac[i] == 0) b /= fac[i],num_c[i]--;
}
for(int i = 1;i <= cnt;i++)
if(num_m[i] > num_c[i]) return 0;
return 1;
}
void solve()
{
sum = 0;
for(int i = 1;i <= n - 1;i++)
{
if(test(i)) ans[++sum] = i + 1;
}
printf("%d\n",sum);
for(int i = 1;i <= sum;i++)
{
if(i > 1) printf(" ");
printf("%d",ans[i]);
}
printf("\n");
}
int main()
{
while(scanf("%d%d",&n,&m) != EOF)
{
init();
solve();
}
return 0;
}