BestCoder Round #66 (div.2)1003 GTW likes function HDU5597

GTW likes function

                                                     Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
                                                                             Total Submission(s): 318    Accepted Submission(s): 177

Problem Description

Now you are given two definitions as follows.

f(x)=∑xk=0(−1)k22x−2kCk2x−k+1,f0(x)=f(x),fn(x)=f(fn−1(x))(n≥1)

Note that  φ(n)  means Euler’s totient function.( φ(n) is an arithmetic function that counts the positive integers less than or equal to n that are relatively prime to n.)

For each test case, GTW has two positive integers —  n  and  x , and he wants to know the value of the function  φ(fn(x)) .

 

Input

There is more than one case in the input file. The number of test cases is no more than 100. Process to the end of the file.

Each line of the input file indicates a test case, containing two integers,  n  and  x , whose meanings are given above.  (1≤n,x≤1012)

 

Output

In each line of the output file, there should be exactly one number, indicating the value of the function  φ(fn(x))  of the test case respectively.

 

Sample Input

  
  

   
   1 1
2 1
3 2
  
  

 

Sample Output

  
  

   
   2
2
2
  
  

 

Source

BestCoder Round #66 (div.2)

出题人：

由打表找规律可得，\sum_{k=0}^{x}(-1)^{k}2^{2x-2k}C_{2x-k+1}^{k}=x+1∑​k=0​x​​(−1)​k​​2​2x−2k​​C​2x−k+1​k​​=x+1，所以显然f_n(x)=n+x+1f​n​​(x)=n+x+1，

因此直接求$\phi (n+x+1)$。时间效率O(T\sqrt{n})O(T√​n​​​)

严格证明：

设a_n=\sum_{k=0}^{n}(-1)^k2^{2n-2k}C_{2n-k+1}^ka​n​​=∑​k=0​n​​(−1)​k​​2​2n−2k​​C​2n−k+1​k​​

a_n=2^{2n}+\sum_{k=1}^{n}(-1)^k2^{2n-2k}(C_{2n-k}^k+C_{2n-k}^{k-1})=\sum_{k=0}^{n}(-1)^k2^{2n-2k}C_{2n-k}^k+\sum_{k=0}^{n-1}(-1)^{k+1}2^{2(n-1)-2k}C_{2(n-1)-k+1}^ka​n​​=2​2n​​+∑​k=1​n​​(−1)​k​​2​2n−2k​​(C​2n−k​k​​+C​2n−k​k−1​​)

=∑​k=0​n​​(−1)​k​​2​2n−2k​​C​2n−k​k​​+∑​k=0​n−1​​(−1)​k+1​​2​2(n−1)−2k​​C​2(n−1)−k+1​k​​

设b_n=\sum_{k=0}^{n}(-1)^k2^{2n-2k}C_{2n-k}^kb​n​​=∑​k=0​n​​(−1)​k​​2​2n−2k​​C​2n−k​k​​，则b_n=a_n+a_{n-1}b​n​​=a​n​​+a​n−1​​

b_n=2^{2n}+\sum_{k=1}^{n-1}(-1)^k2^{2n-2k}(C_{2n-k-1}^k+C_{2n-k-1}^{k-1})+(-1)^nb​n​​=2​2n​​+∑​k=1​n−1​​(−1)​k​​2​2n−2k​​(C​2n−k−1​k​​+C​2n−k−1​k−1​​)+(−1)​n​​

=4\sum_{k=0}^{n-1}(-1)^k2^{2(n-1)-2k}C_{2(n-1)-k+1}^k+\sum_{k=0}^{n-1}(-1)^{k+1}2^{2(n-1)-2k}C_{2(n-1)-k}^k=4∑​k=0​n−1​​(−1)​k​​2​2(n−1)−2k​​C​2(n−1)−k+1​k​​+∑​k=0​n−1​​(−1)​k+1​​2​2(n−1)−2k​​C​2(n−1)−k​k​​

=4a_n-b_{n-1}=4a​n​​−b​n−1​​

得a_n-a_{n-1}=a_{n-1}-a_{n-2}a​n​​−a​n−1​​=a​n−1​​−a​n−2​​。因为a_0=1,a_1=1a​0​​=1,a​1​​=1，所以a_n=n+1a​n​​=n+1

证明比较费时，打表找规律能很快的得出解，所以本题的关键在于打表找规律。

#include 
   
   
    
    
#include 
    
    
     
     
using namespace std;
long long euler(long long n)  //返回euler(n)
{
    long long res=n,a=n;
    for(long long i=2; i*i<=a; i++)
    {
        if(a%i==0)
        {
            res=res/i*(i-1);//先进行除法是为了防止中间数据的溢出
            while(a%i==0) a/=i;
        }
    }
    if(a>1) res=res/a*(a-1);
    return res;
}
int main()
{
    long long n,x,i;
    while(~scanf("%lld%lld",&n,&x))
    {
        printf("%lld\n",euler(x+n+1));
    }
    return 0;
}