zhx's contest (矩阵快速幂 + 数学推论)
2015-03-15 19:49
267 查看
zhx's contest
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 851 Accepted Submission(s): 282[align=left]Problem Description[/align]
As one of the most powerful brushes, zhx is required to give his juniors n problems. zhx thinks the ith problem's difficulty is i. He wants to arrange these problems in a beautiful way. zhx defines a sequence {ai} beautiful if there is an i that matches two rules below: 1: a1..ai are monotone decreasing or monotone increasing. 2: ai..an are monotone decreasing or monotone increasing. He wants you to tell him that how many permutations of problems are there if the sequence of the problems' difficulty is beautiful. zhx knows that the answer may be very huge, and you only need to tell him the answer module p.
[align=left]Input[/align]
Multiply test cases(less than 1000). Seek EOF as the end of the file. For each case, there are two integers n and p separated by a space in a line. (1≤n,p≤1018)
[align=left]Output[/align]
For each test case, output a single line indicating the answer.
[align=left]Sample Input[/align]
2 233
3 5
[align=left]Sample Output[/align]
2
1
Hint
In the first case, both sequence {1, 2} and {2, 1} are legal.
In the second case, sequence {1, 2, 3}, {1, 3, 2}, {2, 1, 3}, {2, 3, 1}, {3, 1, 2}, {3, 2, 1} are legal, so the answer is 6 mod 5 = 1
[align=left]Source[/align]
BestCoder Round #33
#include<stdio.h> typedef long long ll ; ll n , mod ; ll mut (ll a , ll b) { ll ans = 0 ; while (b) { if (b & 1) { ans = (ans + a) % mod ; } a = (a + a ) % mod ; b >>= 1 ; } return ans % mod ; } void mgml (ll a , ll b) { ll ans = 1 ; while (b) { if (b & 1) { ans = mut (ans , a ) ; } b >>= 1 ; a = mut ( a , a ) ; } ans -= 2 ; ans %= mod ; ans += mod ; ans %= mod ; printf ("%I64d\n" , ans ) ; } int main () { //freopen ("a.txt" , "r" , stdin ) ; while (~ scanf ("%I64d%I64d" , &n , &mod)) { if (n == 1) { printf ("%I64d\n" , 1LL % mod ) ; continue ; } mgml (2 , n ) ; } return 0 ; }
View Code
这道题到处是坑,推出2^n - 2照样进坑;
首先要防止n = 1 , p = 1 这种情况;
然后要防止ans - 2 < 0;
然后 是 快速幂 的内部优化,让人耳目一新啊
相关文章推荐
- HDU 4565 So Easy!(数学+矩阵快速幂)
- zhx's contest (hdu 5187 快速幂+快速乘法)
- (矩阵快速幂, 数学公式推导)HDU 6050 Funny Function
- 数学+矩阵快速幂 | 打表找规律+数学归纳
- BZOJ2326 [HNOI2011]数学作业 【矩阵快速幂】
- ZUFE 2469 无人能解得数学题【矩阵快速幂】
- zzuli 2180 GJJ的日常之沉迷数学【矩阵快速幂 || 逆元】
- BZOJ 2326: [HNOI2011]数学作业( 矩阵快速幂 )
- HDU 4565 So Easy!(矩阵快速幂+数学)
- 2017浙工大之江学院校赛D-数学||矩阵快速幂
- HDOJ 题目4549 M斐波那契数列(数学,矩阵快速幂,费马小定理)
- hdu 3117 Fibonacci Numbers 数学 矩阵快速幂
- BZOJ 2326[HNOI2011]数学作业(矩阵快速幂)
- BZOJ2326 HNOI2011数学作业(矩阵快速幂)
- CCF 201312-4 有趣的数 (数位DP, 状压DP, 组合数学+暴力枚举, 推公式, 矩阵快速幂)
- hdu4565(矩阵快速幂+经典的数学处理)
- hdoj 2254 奥运 【矩阵快速幂 + STLmap】 【离散数学的应用】
- hdu 5015 233 Matrix(数学:矩阵快速幂)
- NOIP模拟题 2016.11.15 [LIS] [spfa] [同余最短路] [矩阵快速幂] [容斥原理] [数学]
- Hdu 2256 Problem of Precision[矩阵快速幂 + 数学]