hdu 4861 Couple doubi

Couple doubi

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 201    Accepted Submission(s): 171

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
  
  
  
  


  
  

题目大意

给你k个球以及n（素数），下面每个球i的价值可以由公式 1^i+2^i+...+(p-1)^i (mod p)算出，一个人先取球（肯定是球中最大的了），然后另外一个人取（也肯定是剩下的球中最大的），最后取完后比较两个人所取的球的价值的总数谁大谁小，先手大输出YES否则输出NO。

多校的第一题，在强行找规律下面竟然还找出了规律。

其实是由费马小定理：g    (p−1)%p=1

g=（1~p-1） 这样的话球的第（p-1）个，第（p-1）*2个......一直到第（p-1）*n个 价值是为（p-1）。

别的都是0；（没看太懂，明天证）

#include <cstdio>
#include <cstring>
#include <iostream>

using namespace std;
typedef long long ll;
ll k, p;

int main () {
    while (cin >> k >> p) {
        ll t = k / (p-1);    
        if (t&1)
            cout << "YES" << endl;
        else
            cout << "NO" << endl;
    }
    return 0;
}