Submission #41122018

---

Source Code Expand

#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
#include <cassert>
using namespace std;
using ll = long long;
const double pi = 3.14159265359;
const ll INF = 1LL << 60;

template<class T> inline bool chmin(T& a, T b){ if (a > b){a = b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b){ if (a < b){a = b; return true;} return false;}

//using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;  // mint::set_mod(p); later
//using mint = static_modint<1000000009>;


ll N, L, R;

ll f(ll x){
  return x % (L + R) / L;
}

int main()
{
  cin.tie(0); cout.tie(0); ios::sync_with_stdio(false);

  // 入力
  cin >> N >> L >> R;

  vector<int> a(N);
  for (auto &&t : a) cin >> t;

  ll grundy = 0;
  for (auto x : a){
    grundy ^= f(x);
  }
  
  cout << (grundy == 0 ? "Second" : "First") << endl;
  return 0;
}

Submission Info

Judge Result