题目大意:判断一个关于n的多项式P(n)能否恒整除一个正整数D
题解:设多项式的最高项次数为k。我们只需要把n=1,2,3,……k+1都试一遍就行了。
证明:k=0时,P(n)是常数,若P(1)能整除,则P(n)恒整除D;
k=1时,设P(n)=an+b,为等差数列,只要a,b整除D,则P(n)恒整除D。验证时只需取P(1),P(2)即可;
k=2时,设P(n)=an^2+bn+c,则P(n+1)-P(n)=2an+a+b:=Q(n),要使P(n)恒整除D,则Q(n)必须恒整除D。此时验证Q(n)同k=1时P(n)的情况。即需验证P(3)-P(2),P(2)-P(1).另需验证P(1)。这等价于验证P(1),P(2),P(3);
依次类推,根据数学归纳法,命题得证
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long LL;
const int N=500001;
char str[N];
int n,d;
LL a[N],b[N];//a: power ;b : xishu
LL Calc(LL x)
{
LL Ans=0;
for (int i=1;i<=n;i++){
LL tmp=1;
for (int j=1;j<=a[i];j++)tmp=tmp*x%d;
Ans=(Ans+tmp*b[i]%d)%d;
}
return Ans;
}
int main()
{
//freopen("1.txt","r",stdin);
int Case=0;
while (scanf("%s",str)!=EOF){
if (str[0]=='.')break;
Case++;printf("Case %d: ",Case);
n=0;
int L=strlen(str),i,f;
for (i=1;i<L;i++){
if (str[i]==')')break;
n++;
if (str[i]=='-' || str[i]=='+'){
if (str[i+1]=='n')b[n]=(str[i]=='+')?1:-1;else {
int j=i+1;b[n]=0;
while ('0'<=str[j] && str[j]<='9')b[n]=b[n]*10+str[j]-'0',j++;
b[n]=(str[i]=='+')?b[n]:-b[n];
i=j-1;
}
}else
if (str[i]=='n'){//第一个
b[n]=1;i--;
}else {
int j=i;b[n]=0;
while ('0'<=str[j] && str[j]<='9')b[n]=b[n]*10+str[j]-'0',j++;
i=j-1;
}
if (str[i+1]=='n'){
if (str[i+2]=='^'){
int j=i+3;a[n]=0;
while ('0'<=str[j] && str[j]<='9')a[n]=a[n]*10+str[j]-'0',j++;
i=j-1;
}else {a[n]=1;i++;}
}else a[n]=0;
}
//for (int u=1;u<=n;u++)cout<<a[u]<<" "<<b[u]<<endl;
i+=2;d=0;
for (;i<L;i++)d=d*10+str[i]-'0';
int Flag=1;
for (int i=1;i<=a[1]+1;i++){
if (Calc(i))Flag=0;
}
if (Flag)puts("Always an integer");
else puts("Not always an integer");
}
return 0;
}