# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
20020 | | ilbbke | 괄호 (kriii4_R) | C++98 | | 3 ms | 8896 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<stdio.h>
#define M 1000000007
long long dy[1000005];
int main()
{
int i,n,k;
scanf("%d %d",&n,&k);
dy[1]=1; dy[2]=1;
for(i=3;i<=n;i++)
{
dy[i]=(dy[i-1]+dy[i-2])%M;
}
printf("%d",dy[n]);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |