2014 Multi-University Training Contest 1/HDU4861_Couple doubi(数论/规律)
来源:互联网 发布:mac os 10.95官方原版 编辑:程序博客网 时间:2024/06/05 11:18
解题报告两人轮流取球,大的人赢,,,贴官方题解,,,反正我看不懂,,,先留着理解关于费马小定理关于原根
找规律找到的,,,sad,,,很容易找到循环节为p-1,每一个循环节中有一个非零的球,所以只要判断有多少完整循环节,在判断奇偶,,,#include <iostream>#include <cstdio>#include <cstring>#include <cmath>using namespace std;int main(){ int k,p,i,j; while(scanf("%d%d",&k,&p)!=EOF){ int q=k/(p-1); if(q%2==0) printf("NO\n"); else printf("YES\n"); } return 0;}
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>using namespace std;int main(){ int k,p,i,j; while(scanf("%d%d",&k,&p)!=EOF){ int q=k/(p-1); if(q%2==0) printf("NO\n"); else printf("YES\n"); } return 0;}
Couple doubi
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 145 Accepted Submission(s): 122
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).
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
Source
2014 Multi-University Training Contest 1
0 0
- 2014 Multi-University Training Contest 1/HDU4861_Couple doubi(数论/规律)
- Hdu4861 - Couple doubi - 数论(2014 Multi-University Training Contest 1-1001)
- 2014 Multi-University Training Contest 1 - A. Couple doubi
- hdu 4861 Couple doubi ---2014 Multi-University Training Contest 1
- hdu4861 Couple doubi---2014 Multi-University Training Contest 1
- hdu4861 Couple doubi 2014 Multi-University Training Contest 1
- 2014 Multi-University Training Contest 1 hdu4861 Couple doubi
- 2014(高斯消元 DP 数论)Multi-University Training Contest 1 题解
- Hdu4952 - Number Transformation - 数论(2014 Multi-University Training Contest 8)
- 【数论】2015 Multi-University Training Contest 1 1001
- (HDU 5728)2016 Multi-University Training Contest 1 PowMod(数论)
- 2014 Multi-University Training Contest 1小记
- 2014 Multi-University Training Contest 1
- 2014 Multi-University Training Contest 1
- 2014 Multi-University Training Contest 1
- 2014 Multi-University Training Contest 1
- 2014 Multi-University Training Contest 1 题解
- 2014 Multi-University Training Contest 1
- IBM raid相关操作
- OCP 1Z0 053 194
- 暑期个人赛--第一场--D
- Mysql的varchar(20)到底可以存储多少个中文字符
- 字符串的比较——strcmp
- 2014 Multi-University Training Contest 1/HDU4861_Couple doubi(数论/规律)
- poj-2531
- 【学习记录】面向对象的基础概念
- 编辑器Sublime Text安装配置
- 【git】warning: LF will be replaced by CRLF | fatal: CRLF would be replaced by LF
- Android监听apk的添加、安装、改变、替换、卸载
- OpenCV资料总结
- UVA 607 Scheduling Lectures | dp
- Java类库学习之Object类