Time Limit: 2000⁄1000 MS (Java/Others) Memory Limit: 131072⁄131072 K (Java/Others) Total Submission(s): 206 Accepted Submission(s): 116
One day, Alice and Bob felt bored again, Bob knows Alice is a girl who loves math and is just learning something about matrix, so he decided to make a crazy problem for her.
Bob has a six-faced dice which has numbers 0, 1, 2, 3, 4 and 5 on each face. At first, he will choose a number N (4 <= N <= 1000), and for N times, he keeps throwing his dice for K times (2 <=K <= 6) and writes down its number on the top face to make an N*K matrix A, in which each element is not less than 0 and not greater than 5. Then he does similar thing again with a bit difference: he keeps throwing his dice for N times and each time repeat it for K times to write down a K*N matrix B, in which each element is not less than 0 and not greater than 5. With the two matrix A and B formed, Alice’s task is to perform the following 4-step calculation. Step 1: Calculate a new N*N matrix C = A*B. Step 2: Calculate M = C^(N*N). Step 3: For each element x in M, calculate x % 6. All the remainders form a new matrix M’. Step 4: Calculate the sum of all the elements in M’....Read More
Time Limit: 2000⁄1000 MS (Java/Others) Memory Limit: 65536⁄65536 K (Java/Others) Total Submission(s): 612 Accepted Submission(s): 310
He does the following operations k times. In the i-th operation, x becomes the least integer no less than x, which is the multiple of i.
He wants to know what is the number x now.
Time Limit: 3000⁄1500 MS (Java/Others) Memory Limit: 65536⁄65536 K (Java/Others) Total Submission(s): 590 Accepted Submission(s): 136
Teacher Mai is addicted to game 2048. But finally he finds it’s too hard to get 2048. So he wants to change the rule:
You are given some numbers. Every time you can choose two numbers of the same value from them and merge these two numbers into their sum. And these two numbers disappear meanwhile.
If we can get 2048 from a set of numbers with this operation, Teacher Mai think this multiset is good.
You have n numbers, A1,…,An. Teacher Mai ask you how many subsequences of A are good....Read More
现在，兄弟两找到你这位设计师，希望你给他们设计马场，问共有多少种设计方案。 ##Input...Read More
Time Limit: 9000⁄4500 MS (Java/Others) Memory Limit: 131072⁄131072 K (Java/Others) Total Submission(s): 166 Accepted Submission(s): 76
After division, players can get some coins. If players successfully divide a AxB rectangle(length: A, width: B) into KxK squares(side length: K), they can get A*B/ gcd(A/K,B/K) gold coins. In a level, you can’t get coins twice with same method. (For example, You can get 6 coins from 2x2(A=2,B=2) rectangle. When K=1, A*B/gcd(A/K,B/K)=2; When K=2, AB/gcd(A/K,B/K)=4; 2+4=6; ) There are N(N+1)/2 levels in this game, and every level is an unique rectangle. (1x1 , 2x1, 2x2, 3x1, …, Nx(N-1), NxN)...Read More