题解:
Code:
C
o
d
e
:
#include<bits/stdc++.h>
#define ll long long
#define N 100005
#define mod 100003
using namespace std;
ll b[N];int a[N];
ll power(ll x,ll y)
{
ll ans=1;
while(y)
{
if(y&1)ans=ans*x%mod;
x=x*x%mod;
y>>=1;
}
return ans;
}
int main()
{
int num=0,n,k;
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
for(int i=n;i>=1;i--)
if(a[i])
{
for(int j=1;j*j<=i;j++)
if(i%j==0)
{
a[j]^=1;
if(j*j!=i)a[i/j]^=1;
}
num++;
}
b[n+1]=0;
for(int i=n;i>=1;i--)
b[i]=(b[i+1]*(n-i)%mod+n)%mod*power(i,mod-2)%mod;
ll ans=0;
if(n==k||k>num)ans=num;else
{
for(int i=num;i>k;i--)
ans=(ans+b[i])%mod;
ans=(ans+k)%mod;
}
for(int i=1;i<=n;i++)ans=ans*i%mod;
printf("%lld\n",ans);
return 0;
}