#include <bits/stdc++.h> #pragma GCC Optimize("O3") #define FOR(i, x, y) for (int i = x; i < y; i++) #define MOD 1000000007 typedef long long ll; using namespace std; #include "gondola.h" int valid(int n, int inputSeq[]) { FOR(i, 0, n) { if (inputSeq[i] <= n) { FOR(j, 1, n + 1) { if (inputSeq[(i + j - inputSeq[i] + 100 * n) % n] <= n && inputSeq[(i + j - inputSeq[i] + 100 * n) % n] != j) return 0; } return 1; } } return 1; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- int countReplacement(int n, int inputSeq[]) { return -3; }

gondola.cpp:2:0: warning: ignoring #pragma GCC Optimize [-Wunknown-pragmas]
 #pragma GCC Optimize("O3")