# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
24610 | jiangzhi | Kangaroo (CEOI16_kangaroo) | C++11 | 0 ms | 0 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>
const int N = 2010;
int vec[N];
int main(){
freopen("kangaroo.in","r",stdin);
freopen("kangoroo.out","w",stdout);
int n,s,e;
scanf("%d%d%d", &n,&s,&e);
for(int i = 1; i <= n ;i++){
scanf("%d", &vec[i]);
}
int ans = 0;
do{
if(s!=vec[0] || e != vec[n-1])continue;
int ok = 1;
for(int i = 0; i < n-2; i++){
if((vec[i] - vec[i+1] > 0) == (vec[i+1] - vec[i+2] >0))ok=0;
}
if(ok)ans=+;
}while(next_permutation(vec,vec+n));
printf("%d\n",ans);
}