Submission #1473963

---

Source Code Expand

#include <bits/stdc++.h>
#define int long long
#define N 100010
using namespace std;
const int INF = 1LL<<55;
int Max(int &a,int b){return a=max(a,b);}
int Min(int &a,int b){return a=min(a,b);}
int n,A,B,stone[N];

signed main(){
  cin>>n>>A>>B;
  for(int i=0;i<n;i++) cin>>stone[i];

  int ans = 0;
  if( A == B )for(int i=0;i<n;i++) ans ^= stone[i]%(A+1);
  else if(min(A,B) >= *max_element(stone,stone+n)) for(int i=0;i<n;i++) ans ^= stone[i];
  else if( ans>B )ans = 1;
  else {
    for(int i=0;i<n;i++) ans ^= stone[i];
    ans = ans < A;
  }
  cout<<(ans? "Hanako":"Jiro")<<endl;
  return 0;
}

Submission Info

Judge Result