# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
316654 | Tahmid690 | 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 "shoes.h"
using namespace std;
long long count_swaps(vector<int> ara){
if(n==1){
if(ara[0]<0) return 0;
else return 1;
}
long long n;
n=ara.size();
n/=2;
return (n*(n-1))/2;
}