# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
19856 | | str | 괄호 (kriii4_R) | C++14 | | 0 ms | 4988 KiB |
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 1000001
int DP[MAX];
int N, K;
int main(){
scanf("%d %d", &N, &K);
DP[1] = 1;
DP[2] = 2;
for (int i = 3; i <= N; i++)
DP[i] = (DP[i - 1] + DP[i - 2]) % 1000000007;
printf("%d\n", DP[N]);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |