This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#define MAX_NUM 1000004
#define XXX 1000000007
long long dp[MAX_NUM];
int main(){
int N, K; scanf("%d%d", &N, &K);
// init
dp[0] = 1; // for duplicated one
dp[1] = K;
for(int i = 2; i <= N; i++){
long long &now = dp[i];
long long &pre = dp[i - 1];
now = 0;
// odd
if(i & 1){
}else{
now += dp[i / 2];
}
now %= XXX;
now += pre * K * 2;
//// subtract overlaped part
long long dup = dp[i - 2] * K * K;
dup %= XXX;
now += (XXX - dup);
now %= XXX;
}
printf("%lld\n", dp[N]);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |