# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
560145 | Stavab | 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>
using namespace std;
int S[100000]
long long count_swaps()
{
if(S[0] < 0) return 0;
else return 1;
}
int main()
{
int n;
cin >> n;
for(int i = 0; i < n; i++)
{
cin >> S[i];
}
cout << count_swaps();
return 0;
}