# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
198901 | kshitij_sodani | 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 <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long int llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
int count_swaps(int* s){
if(s[0]<0){
return 0;
}
else{
return 1;
}
return 1;
}
int main(){
int n;
cin>>n;
int s[n];
for(int i=0;i<n;i++){
cin>>s[i];
}
cout<<count_swaps(s)<<endl;
return 0;
}