hdu4861 Couple doubi 2014 Multi-University Training Contest 1

来源:互联网 发布:域名被墙跳转技术 编辑:程序博客网 时间:2024/06/05 13:28

Couple doubi

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


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 320 3
 

Sample Output
YESNO
 


费马小定理推出来的,比赛的时候遇到这类推公式题实在不会就打表吧

#include <iostream>#include <cstring>#include <cstdio>using namespace std;int main(){    int n,p;    while(scanf("%d%d",&n,&p)!=EOF)    if(n/(p-1)&1) printf("YES\n");    else printf("NO\n");    return 0;}


0 0
原创粉丝点击