# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
894227 | ozner77 | 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 "shoes.h"
#include <bits/stdc++.h>
using namespace std;
long long count_swaps(std::vector<int> s) {
return 1;
int a,b,count_swaps;
vector<int> V;
cin>>a;
for(int i=0;i<a;i++){
cin>>b;
V.push_back(b);
}
if(V[0]<0){
count_swaps=0;
cout<<0;
}else{
count_swaps=1
cout<<1;
}
}