# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
314544 | baibhav26062008 | 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 "shoes.h"
#include <bits/stdc++.h>
using namespace std;
long long count_swaps(std::vector<int> s) {
int n = s.size();
if (n == 1) {
if (s[0] < s[1]) {
return 0;
} else {
return 1;
}
}
for (int i = 0; i < n; i++) {
ans++;
}
return ans;
}