HDU 4861

        这道题是一道简单题，可是让我卡了半天。

        开始，一直不知道那两个人是如何拿球的。最初以为他们是按球的编号顺序轮流拿，发现这连样例都过不了，还超时，后来无奈先输出每个球的值，再根据输出情况发现取球的规律，无意中发现这种计算球价值的方法得到的结果是十分有规律的，最后侥幸过了此题。

        回过头来想想，既然想赢，那么每次取值最大的就好了，所以根本用不着犯迷糊。此外面对这种用直白的方法肯定超时的情况，找规律是一个很好的选择，除非你知道有个数学公式能很快解决。

        输出每个球价值的程序（输入与样例一致）：

#include <cstdlib>
#include <iostream>

using namespace std;

int p;

__int64 fpow(__int64 a,int n)
{
    __int64 res;
    res=1;
    while(n)
    {
       if(n%2==1) res=(res*a)%p;
       n>>=1;
       a=(a*a)%p;     
    }
    return res;
}

int main(int argc, char *argv[])
{
    int k,i,j;
    __int64 tmp;
    while(scanf("%d %d",&k,&p)!=EOF)
    {            
        for(i=1;i<=k;i++)
        {
           tmp=0;               
           for(j=1;j<p;j++)
           {
               tmp=(tmp+fpow(j,i))%p; 
                            
           } 
           cout<<"No."<<i<<'\t'<<tmp<<endl;                     
        }        
    }
    system("PAUSE");
    return EXIT_SUCCESS;
}

         提交代码（G++）：

#include <cstdlib>
#include <iostream>

using namespace std;

int main(int argc, char *argv[])
{
    int k,p,t;
    while(scanf("%d %d",&k,&p)!=EOF)
    {
        t=k/(p-1);
        if(t%2==1) printf("YES\n");
        else printf("NO\n");
    }
    system("PAUSE");
    return EXIT_SUCCESS;
}

题目（ http://acm.hdu.edu.cn/showproblem.php?pid=4861）：

Couple doubi

                                                                                Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Problem Description

DouBiXp has a girlfriend named DouBiNan.One day they felt very boring and decided to play some games. The rule of this game is as following. There are k balls on the desk. Every ball has a value and the value of ith (i=1,2,...,k) ball is 1^i+2^i+...+(p-1)^i (mod p). Number p is a prime number that is chosen by DouBiXp and his girlfriend. And then they take balls in turn and DouBiNan first. After all the balls are token, they compare the sum of values with the other ,and the person who get larger sum will win the game. You should print “YES” if DouBiNan will win the game. Otherwise you should print “NO”.

 

Input

Multiply Test Cases. 
In the first line there are two Integers k and p(1<k,p<2^31).

 

Output

For each line, output an integer, as described above.

 

Sample Input

  
  

   
   2 3
20 3
  
  

 

Sample Output

  
  

   
   YES
NO