#include <bits/stdc++.h>
int gondolaSequence[100001];
int replacementSequence[250001];
#include "gondola.h"
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define sol (k+k)
#define sag (k+k+1)
#define orta ((bas+son)/2)
#define coc g[node][i]
#define mod 1000000007
#define inf 1000000009
#define N 1000005
using namespace std;
typedef long long ll;
typedef pair < int , int > ii;
int n, a[N];
int valid(int n, int a[]){
int x = inf;
for(int i = 0; i < n; i++){
a[i]--;
if(a[i] < n and a[i] >= 0){
if(x != inf and x != (a[i] - i + n)%n )
return 0;
x = (a[i] - i + n)%n;
}
}
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
// int main()
// {
// freopen("in.txt", "r", stdin);
// freopen("outt.txt", "w", stdout);
// int i, n, tag;
// int nr;
// assert(scanf("%d", &tag)==1);
// assert(scanf("%d", &n)==1);
// for(i=0;i< n;i++)
// assert( scanf("%d", &gondolaSequence[i]) ==1);
// switch (tag){
// case 1: case 2: case 3:
// printf("%d\n", valid(n, gondolaSequence));
// break;
// case 4: case 5: case 6:
// nr = replacement(n, gondolaSequence, replacementSequence);
// printf("%d ", nr);
// if (nr > 0)
// {
// for (i=0; i<nr-1; i++)
// printf("%d ", replacementSequence[i]);
// printf("%d\n", replacementSequence[nr-1]);
// }
// else printf("\n");
// break;
// case 7: case 8: case 9: case 10:
// printf("%d\n", countReplacement(n, gondolaSequence));
// break;
// }
// return 0;
// }
Compilation message
/tmp/ccdm3cma.o:(.bss+0xf4260): multiple definition of `gondolaSequence'
/tmp/cckzAlia.o:(.bss+0x4c4b80): first defined here
/tmp/ccdm3cma.o:(.bss+0x0): multiple definition of `replacementSequence'
/tmp/cckzAlia.o:(.bss+0x3d0920): first defined here
collect2: error: ld returned 1 exit status
