# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71702 | the_general (#119) | Cross on the Grid (FXCUP3_cross) | C++98 | 3 ms | 404 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 MOD 1000000007
int a(int);
int b(int);
int c(int);
int d(int);
int n;
int a(int x){
if(x<3) return 0;
if(x==3) return 1;
return (c(x-2)+b(x-1)-a(x-2)+b(x-2)+d(x-3))%MOD;
}
int b(int x){
if(x<3) return 0;
if(x==3) return 1;
return (c(x-2)+a(x-1)-b(x-2)+a(x-2)+d(x-3))%MOD;
}
int c(int x){
if(x<3) return 0;
if(x==3) return 1;
return (a(x-2)+b(x-2)+d(x-3))%MOD;
}
int d(int x){
if(x==1 || x==2) return 1;
return ((a(x)+b(x))%MOD+c(x)+d(x-1))%MOD;
}
int main(){
scanf("%d", &n);
printf("%d", (d(n))%MOD);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |