希望更丰富的展现？使用Markdown
by zybnxy @ 2018-10-23 20:40:47
@[XWHTOM](/space/show?uid=64050) 希望更丰富的展现？使用Markdown
by Prurite @ 2018-10-23 20:41:01
希望更丰富的展现？使用Markdown
by xenonex @ 2018-10-23 20:42:15
楼主代码如下
```cpp
// luogu-judger-enable-o2
//快速幂||取余运算
#include<stdio.h>
#include<iostream>
using namespace std;
int quick(int b,int p,int k)
{
int tmp=1;
while(p!=0)
{
if(p%2==1)
tmp=tmp*b%k;
p=p/2;
b=b*b%k;
}
return tmp;
}
int main()
{
int b,p,k;
scanf("%d%d%d",&b,&p,&k);
printf("%d^%d mod %d=%d",b,p,k,quick(b,p,k));
return 0;
}
```
by 波风水门 @ 2018-10-23 20:43:27
//快速幂||取余运算
#include<stdio.h>
#include<iostream>
using namespace std;
int quick(int a,int b,int p)
{
int tmp=1;
while(b!=0)
{
if(b%2==1)
tmp=tmp*a%p;
b=b/2;
a=a*a%p;
}
return tmp%p;
}
int main()
{
long long b,p,k;
scanf("%ld%ld%ld",&b,&p,&k);
printf("%d^%d mod %d=%d",b,p,k,quick(b,p,k));
return 0;
}
by XWHTOM @ 2018-10-23 20:43:32
@[XWHTOM](/space/show?uid=64050) [楼主我给你看个宝贝](https://www.luogu.org/wiki/show?name=%E5%B8%AE%E5%8A%A9%EF%BC%9Amarkdown)
by 清正美记者 @ 2018-10-23 20:45:15
希望更丰富的展现？使用Markdown
by 2x6_81 @ 2018-10-23 20:46:09
@四代目火影，多谢了
by XWHTOM @ 2018-10-23 20:46:52
```
inline int fpow(int x,int k){
int r=1;
for(;k;k>>=1,x=1ll*x*x%P)
if(k&1)r=1ll*x*r%P;
return r;
}
```
by keydu @ 2018-10-23 20:49:05
@[XWHTOM](/space/show?uid=64050)
by keydu @ 2018-10-23 20:49:44