| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 335344 | blue | Gondola (IOI14_gondola) | 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 "gondola.h"
using namespace std;
int valid(int n, int inputSeq[])
{
for(int i = 1; i < n; i++) if(inputSeq[i] % n != (inputSeq[i-1] + 1) % n) return 0;
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return 0;
}
int countReplacement(int n, int inputSeq)
{
return 0;
}
