| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 580735 | vladilius | Arranging Shoes (IOI19_shoes) | C++17 | 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>
using namespace std;
int count_swaps(int l[]){
int n = sizeof(l) / sizeof(l[0]);
if (n == 2){
if (l[0] < l[1]){
return 0;
}
else {
return 1;
}
}
}
int main(){
int n; cin>>n;
int l[n];
for (int i = 0; i < n; i++){
cin>>l[i];
}
cout<<count_swaps(l);
}
