#include "gondola.h" #include<bits/stdc++.h> using namespace std; #define ll long long int valid(int n, int inputSeq[]){ for(int i = 0; i < n; i ++){ // cout << i << " " << inputSeq[i] << " " << inputSeq[(i+1)%n] << endl; if(inputSeq[(i+1)%n]-inputSeq[i] != 1 and inputSeq[(i+1)%n]-inputSeq[i] != 1-n) return 0; } return 1; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- const ll MOD = 1000000009; int countReplacement(int n, int inputSeq[]){ int mx = inputSeq[0],mn = inputSeq[0]; for(int i = 1; i < n; i ++){ mx = max(mx,inputSeq[i]); mn = min(mn,inputSeq[i]); } if(mn > n){ ll ans = 1; for(int i = 1; i <= n; i ++){ ans = (ans*i)%MOD; } return ans; } else assert(0 == 1); }