计算x^p mod m 利用倍增法实现

#include <cstdio>
const int N=110;
int x,p,m,a[N];
long long s;
int main(){
scanf("%d%d%d",&x,&p,&m);
//将p转成二进制传入a数组
int k=0;
while(p>0){
++k;
a[k]=p%2;
p=p/2;
}

for(int i=k;i>0;--i) printf("%d",a[i]);
printf("\n");

//初始化连续变量t和答案s
long long t=x;