# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
298236 | Rayaabualjamal | 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 <iostream>
#include <vector>
#include <cstdio>
#define rep(i,a,b) for(int i = a; i<b; i++)
using namespace std;
long long count_swaps(vector<int> s) {
if(s.size()==2){
if(s[0]<0){
return 0;
}else{
return 1;
}
}
//vector <int> n(n), p(n), sum(n+n, 0);
long long ans = 0;
rep(i,0,n){
ans+= i;
}
return ans;
}