# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
316741 | Dipto_Debdip | 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;
#define ll long long int
bool prime(ll n) {
if(n <= 1) return 0;
if(n == 2) return 1;
else {
for(ll i = 2; i <= sqrt(n); i++) {
if( n % i == 0 ) return 0;
}
}
return 1;
}
int main(int argc, char const *argv[]) {
int n, a, b;
cin >> n;
cin >> a >> b;
if(a < 0) cout << 1 << endl;
else cout << 0 << endl;
return 0;
}