作业帮 > 英语 > 作业

一道ACM问题(数论)

来源:学生作业帮 编辑:作业帮 分类:英语作业 时间:2024/05/12 04:58:31
一道ACM问题(数论)
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
#include <iostream>
using namespace std;

int main() {
int k, p;
while (cin >> k >> p) {
if (k / (p - 1) % 2) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
}
} 思路当 i 是 p-1 的倍数的时候, 第i个小球的价值是p-1
否则小球的价值是0
再问: 我知道这个结论,但是不知道为什么会这样,能否解释一下?
再答: http://blog.csdn.net/keshuai19940722/article/details/38050899