题目:http://www.luogu.org/problem/show?pid=1965
分析:快速幂,注意取模
代码:
#include <cstdio>
#include <algorithm>
using namespace std;
int n,m,x;
unsigned long long int ans;
void quickpower(unsigned long long int base,int k)
{
ans=m;
while(k>0)
{
if(k%2==1) ans=(ans*base)%n;
k>>=1;
base=(base*base)%n;
}
return;
}
int main()
{
int k;
scanf("%d %d %d %d",&n,&m,&k,&x);
quickpower(10,k);
ans=(x+ans)%n;
printf("%llu",ans);
return 0;
}