UVALive 4119 Always an integer （差分数列，模拟）

转载请注明出处： http://www.cnblogs.com/fraud/           ——by fraud

Always an integer

Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

Combinatorics is a branch of mathematics chiefly concerned with counting discrete objects. For instance, how many ways can you pick two people out of a crowd of n people? Into how many regions can you divide a circular disk by connecting n points on its boundary with one another? How many cubes are in a pyramid with square layers ranging from 1×1 to n×n cubes?

Many questions like these have answers that can be reduced to simple polynomials in n . The answer to the first question above is n(n - 1)/2 , or (n2 - n)/2 . The answer to the second is (n4 - 6n3 + 23n2 - 18n + 24)/24 . The answer to the third is n(n + 1)(2n + 1)/6 , or (2n3 + 3n2 + n)/6 . We write these polynomials in a standard form, as a polynomial with integer coefficients divided by a positive integer denominator.

These polynomials are answers to questions that can have integer answers only. But since they have fractional coefficients, they look as if they could produce non-integer results! Of course, evaluating these particular polynomials on a positive integer always results in an integer. For other polynomials of similar form, this is not necessarily true. It can be hard to tell the two cases apart. So that, naturally, is your task.

Input

The input consists of multiple test cases, each on a separate line. Each test case is an expression in the form (P)/D , where P is a polynomial with integer coefficients and D is a positive integer denominator. P is a sum of terms of the form CnE , where the coefficient C and the exponent E satisfy the following conditions:

1. E is an integer satisfying 0E100 . If E is 0, then CnE is expressed as C . If E is 1, then CnE is expressed as Cn , unless C is 1 or -1. In those instances, CnE is expressed as n or - n .
2. C is an integer. If C is 1 or -1 and E is not 0 or 1, then the CnE will appear as nE or - nE .
3. Only non-negative C values that are not part of the first term in the polynomial are preceded by +.
4. Exponents in consecutive terms are strictly decreasing.
5. C and D fit in a 32-bit signed integer.

See the sample input for details.

Input is terminated by a line containing a single period.

Output

For each test case, print the case number (starting with 1). Then print `Always an integer' if the test case polynomial evaluates to an integer for every positive integer n . Print ` Not always an integer' otherwise. Print the output for separate test cases on separate lines. Your output should follow the same format as the sample output.

Sample Input

(n^2-n)/2 
(2n^3+3n^2+n)/6 
(-n^14-11n+1)/3 
.

Sample Output

Case 1: Always an integer 
Case 2: Always an integer 
Case 3: Not always an integer

题目的意思是让你判断一个整系数多项式的值是否一直都能被一个所给的正整数所整除。

通过对差分数列的不断求导，我们可以发现，对于任意多项式P，我们只需要判断从1到k+1是否满足就行了，其中，k为多项式P中的最高次数。

接下来就是纯模拟了。

#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <cstdio>
using namespace std;
string s;
vector<pair<long long,long long> >vec;
long long fast_mod(long long m,long long n,long long fenm)
{
    long long ret=1;
    long long temp=m;
    while(n)
    {
        if(n&1)
        {
            ret=ret*temp;
            ret%=fenm;
        }
        temp=temp*temp;
        temp%=fenm;
        n>>=1;
    }
    return ret;
}
int main()
{
    ios::sync_with_stdio(false);
    int cas=1;
    //freopen("in.in","r",stdin);
    while(cin>>s)
    {
        if(s==".")break;
        int len=s.length();
        vec.clear();
        int pos=0;
        while(pos<len&&s[pos]!='/')pos++;
        long long fenm=0;
        int index=pos+1;
        while(index<len)    fenm=s[index++]-'0'+fenm*10;
        if(fenm==0)fenm=1;
        long long a,b;
        long long maxx=0;
        bool chac=0;
        for(int i=0;i<pos;)
        {
            chac=0;
            a=0,b=0;
            if(s[i]=='(')i++;
            if(s[i]==')'||s[i]=='/')break;
            if(s[i]=='+'||s[i]=='-')
            {
                if(s[i]=='-')chac=1;
                i++;
            }
            while(i<pos&&s[i]!='/'&&s[i]!='n'&&s[i]!=')')
            {
                a*=10;
                a+=s[i++]-'0';
            }
            if(a==0)a=1;
            if(chac)a*=-1;
            if(s[i]=='/'||s[i]==')')
            {
                vec.push_back(make_pair(a,0));
                break;
            }
            i++;
            if(s[i]=='^')i++;
            while(i<pos&&s[i]>='0'&&s[i]<='9')
            {
                b*=10;
                b+=s[i++]-'0';
            }
            if(b==0)b=1;
            vec.push_back(make_pair(a,b));
            maxx=max(b,maxx);
        }
        bool flag=0;
        long long temp;
        for(int i=1;i<=maxx+1;i++)
        {
            temp=0;
            for(int j=0;j<vec.size();j++)
            {
                temp+=(vec[j].first*fast_mod(i,vec[j].second,fenm))%fenm;
                temp%=fenm;
            }
            if(temp){flag=1;break;}
        }
        cout<<"Case "<<cas++<<": ";
        if(flag)cout<<"Not always an integer"<<endl;
        else cout<<"Always an integer"<<endl;
        s.clear();
    }
    return 0;
}