| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 147386 | mosiashvililuka | Arranging Shoes (IOI19_shoes) | C++14 | 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<bits/stdc++.h>
#include "grader.h"
using namespace std;
long long a,b,c,d,e,f[200009];
long long count_swaps(int S[]){
for(a=1; ; a++) if(S[a-1]==0) break;
for(b=1; b<=a; b++) f[b]=S[b-1];
if(f[1]<0) return 0LL; else return 1LL;
}