First question a in more than 2014 schools | HDU 4861 couple doubi

Question Link

Q: I have k balls. I can give you a number of P and obtain K values (I = 1, 2 ,..., k): 1 ^ I + 2 ^ I +... + (p-1) ^ I (mod P ). then, the girlfriend obtains the data first, and then XP obtains the data, both of which hope to win. If the girlfriend wins, yes is output; otherwise, no is output.

Idea: This question is about to come out after calculation on paper. To win, it must be big at first, according to the rule, we can find that the final result of the remainder operation is either 0 or a certain number, so we can check whether there are odd or even numbers.

Official question:

1 # include <stdio. h> 2 # include <string. h> 3 # include <iostream> 4 5 using namespace STD; 6 7 int main () 8 {9 int K, P; 10 while (~ Scanf ("% d", & K, & P) 11 {12 if (K/P-1) % 2) puts ("yes "); 13 else puts ("no"); 14} 15 return 0; 16}

View code