| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|
| 19748 |  | jihoon | 괄호 (kriii4_R) | C++98 |  | 2 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>
int fibo[1000002];
int main(){
	int n,k;
  scanf("%d %d",&n,&k);
  fibo[0]=0;fibo[1]=1;
  for(int i=2;i<=n;i++){
    fibo[i]=fibo[i-1]+fibo[i-2];
    fibo[i]%=1000000007;
  }
  printf("%d",fibo[n]);
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |