【bzoj 3142】: [Hnoi2013]数列

http://www.lydsy.com/JudgeOnline/problem.php?id=3142

ans=N*M^(K-1)-M^(K-1)*(K-1)*(M+1)/2

#define _TEST _TEST
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
/************************************************
Code By willinglive    Blog:http://willinglive.cf
************************************************/
#define rep(i,l,r) for(int i=(l),___t=(r);i<=___t;i++)
#define per(i,r,l) for(int i=(r),___t=(l);i>=___t;i--)
#define MS(arr,x) memset(arr,x,sizeof(arr))
#define LL long long
#define INE(i,u,e) for(int i=head[u];~i;i=e[i].next)
inline const LL read()
{LL r=0,k=1;char c=getchar();for(;c<'0'||c>'9';c=getchar())if(c=='-')k=-1;
for(;c>='0'&&c<='9';c=getchar())r=r*10+c-'0';return k*r;}
/
LL n,k,m,p;
/
LL pow_mod(LL a,LL b,LL p){LL t=1;for(;b;b>>=1,a=a*a%p)if(b&1)t=t*a%p;return t;}
/
void input()
{
    n=read(); k=read(); m=read(); p=read();
}
void solve()
{
	if(k==1) {cout<<n%p;return;}
	LL ans=((n%p)*pow_mod(m,k-1,p))%p;
	ans-=(pow_mod(m,k-2,p)*((k-1)%p))%p*((m*(m+1)/2)%p)%p;
	if(ans<0) ans+=p;
	cout<<ans<<endl;
}
/
int main()
{
    #ifndef _TEST
    freopen("std.in","r",stdin); freopen("std.out","w",stdout);
    #endif
    input(),solve();
    return 0;
}