# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
952650 | 2024-03-24T12:51:13 Z | batsukh2006 | Arranging Shoes (IOI19_shoes) | C++17 | 0 ms | 0 KB |
#include<iostream> #include<stdio.h> #include<math.h> #include<map> #include<string> #include<algorithm> #include<vector> #include<string.h> #include<utility> #include<set> #include<cmath> #include<queue> #include<deque> #include<functional> #include<stack> #include<limits.h> #include<iomanip> #include<unordered_map> using namespace std; #define MOD 1000000007 #define int long long #define endl '\n' void solve(){ int n; cin>>n; vector<int> a(n+1); for(int i=1; i<=n; i++) cin>>a[i]; if(a[1]<0) cout<<0; else cout<<1; } signed main(){ // freopen("hps.in", "r", stdin); // freopen("hps.out", "w", stdout); ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t=1; // cin>>t; while(t--){ solve(); cout<<endl; } return 0; }