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
http://blog.csdn.net/Enjoying_Science/article/details/48770427
答案内容至少10个字符
2 shunfurh shunfurh 于 2017.10.29 10:08 提问
Test for Rikka
matrixlineseachasit
Problem Description
As we know, Rikka is poor at math. At the test, Rikka finds that she cannot even do a single problem. There is one of the insane problems:
Given an integer K, she needs to come up with an n×n 01 matrix A and an integer m which meet B1,n=K, where B=Am.
It is too difficult for Rikka. Can you help her?
Input
The first line of the input is a single integer T (T=40), indicating the number of testcases.
Each of the next T lines contains one integer K (0≤K≤1018).
Output
For each testcase, the first line contains two space-separated integers n,m (1≤n,m≤30).
In each of following n lines print n characters (0 or 1) - the matrix A you find.
Sample Input
1
4
Sample Output
2 4
11
01
同问0 |浏览7| 收藏0 |分享
||||||
000:0
我要回答
猜你喜欢换一换
matrix类c#实现
matrix analysis 2nd edition
matrix cook book