# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
144692 | AASG | 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"
long long count_swaps(std::vector<int> s) {
if(s[0]<1 && s.size()==1)return 0;
else if(s[0]>1 && s.size()==1) return 1;
std::int a;
a=s.size();
return (a-1)*(a-2)/2;
}