# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
604254 | HunterXD | 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pl;
typedef double long dl;
#define f first
#define s second
#define pb push_back
#define sz(x) int((x).size())
#define all(x) begin(x), end(x)
#define ts to_string
#define lb lower_bound
#define ub upper_bound
#define yes cout << 'Y' << 'E' << 'S' << endl
#define no cout << 'N' << 'O' << endl
#define nd "\n"
const int pmod = 998244353;
const int mod = 1e9 + 7;
const ll inf = 1e18;
ll count_swaps(vector<ll> shoes) {
if (shoes[0] > 0 && shoes.size() == 2) {
return 1;
}
return 0;
}
void solve() {
ll n;
cin >> n;
vector<ll> a(n, 0);
for (ll i = 0; i < n; i++) cin >> a[i];
cout << count_swaps(a) << endl;
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
ll t = 1;
while (t--) solve();
return 0;
}