# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
19655 |
2016-02-25T04:07:50 Z |
yukariko |
괄호 (kriii4_R) |
C++14 |
|
4 ms |
19704 KB |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int N, M;
int cache[1000001];
int solve(int pos)
{
if(pos > N)
return 0;
if(pos == N)
return 1;
int& ans = cache[pos];
if(ans != -1)
return ans;
ans = (1LL * solve(pos + 1) * M) % MOD;
ans = (ans + 1LL * solve(pos + 2) * M) % MOD;
return ans;
}
int main()
{
memset(cache, -1, sizeof(cache));
scanf("%d%d", &N, &M);
printf("%d", solve(0));
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
19704 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Halted |
0 ms |
0 KB |
- |