BestCoder Round #33(zhx's contest-快速乘法)
来源:互联网 发布:c并发编程实战 pdf 编辑:程序博客网 时间:2024/05/29 04:48
zhx's contest
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1366 Accepted Submission(s): 437
Problem Description
As one of the most powerful brushes, zhx is required to give his juniorsn problems.
zhx thinks theith 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 modulep .
zhx thinks the
zhx defines a sequence
1:
2:
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
Input
Multiply test cases(less than 1000 ). Seek EOF as the end of the file.
For each case, there are two integersn and p separated by a space in a line. (1≤n,p≤1018 )
For each case, there are two integers
Output
For each test case, output a single line indicating the answer.
Sample Input
2 2333 5
Sample Output
21HintIn 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
Source
BestCoder Round #33
Recommend
hujie | We have carefully selected several similar problems for you: 5193 5192 5191 5190 5189
本题使用快速乘法和快速幂
其中,快速乘法就是把乘数a的2进制(100010101)2 这样的数
分解成(2^p0+2^p1+...)*b=2^p0*b+2^p1*b .... 然后算
本题快速幂和快速乘法均用栈。
PS:由于忘了在sub()处%F 又WA又T的
#include<cstdio>#include<cstring>#include<cstdlib>#include<algorithm>#include<functional>#include<iostream>#include<cmath>#include<cctype>#include<ctime>using namespace std;#define For(i,n) for(int i=1;i<=n;i++)#define Fork(i,k,n) for(int i=k;i<=n;i++)#define Rep(i,n) for(int i=0;i<n;i++)#define ForD(i,n) for(int i=n;i;i--)#define RepD(i,n) for(int i=n;i>=0;i--)#define Forp(x) for(int p=pre[x];p;p=next[p])#define Forpiter(x) for(int &p=iter[x];p;p=next[p]) typedef __int64 ll;ll n,F;ll add(ll a,ll b){return (a+b)%F;}void upd(ll &a,ll b){a=(a%F+b%F)%F;}ll mul(ll a,ll b) //c=a*b=a^l1+a^l2+...+a^l3 //把b改成2进制,各位分别相乘相加 {ll c=0;while(b){if (b&1) c=(c+a)%F; a=(a+a)%F; b>>=1; }return c%F;}ll sub(ll a,ll b){if ((a-b)<0) return (a-b+F)%F;return (a-b)%F;}ll pow2(ll a,ll b){if (b==1) return a%F;if (b==0) return 1%F;ll ret=1;while (b){if (b&1) ret=mul(ret,a);a=mul(a,a);b>>=1;} return ret%F;}int main(){//freopen("zhx's contest.in","r",stdin);while(scanf("%I64d%I64d",&n,&F)==2){if (n==1) printf("%I64d\n",1%F);else printf("%I64d\n",sub(pow2(2%F,n),2));}return 0;}
0 0
- BestCoder Round #33(zhx's contest-快速乘法)
- zhx's contest BestCoder Round #33(快速乘法+快速幂的原理)
- BestCoder Round #33 1002 zhx's contest
- HDU 5187 zhx's contest(快速乘法)
- BestCoder Round #33 1001 zhx's submissions
- zhx's contest (hdu 5187 快速幂+快速乘法)
- HDU 5187 zhx's contest(快速幂+快速乘法)
- HDU 5187-zhx's contest(快速乘法+快速幂取模)
- zhx's contest(快速幂+快速乘法)
- HDU 5187zhx's contest(快速幂乘法)
- hdu 5188 zhx and contest && BestCoder Round #33
- BestCoder #33 zhx's submissions
- hdu 5187 zhx's contest(快速幂,快速乘法,排列组合)
- zhx's contest----快速幂+快速乘
- 【01背包+限制条件】HDU5188-zhx and contest【BestCoder Round #33】
- hdu 5187 zhx and contest(快速幂、快速乘法)
- BestCoder Round #33(zhx's submissions-手速题,注意判断00和0的情况)
- HDU - 5187 - zhx's contest (快速幂+快速乘)
- [Python学习] 专题三.字符串的基础知识
- nginx域名301重定向
- windows 下phpredis的安装
- 2015.3.26
- HDOJ 猜数字 2178
- BestCoder Round #33(zhx's contest-快速乘法)
- [Python学习] 简单网络爬虫抓取博客文章及思想介绍
- [Python学习] 专题四.文件基础知识
- Android的Intent
- nginx下discuz x3的伪静态规则
- 线性表链式存储(双向循环链表)及其14种操作的实现
- python2.7.6安装web.py 0.37报编码错误
- [python学习] 简单爬取维基百科程序语言消息盒
- iOS 推送通知”详解:从创建到设置到运行