Submission #1556266

---

Source Code Expand

#include <bits/stdc++.h>

#define PB          push_back
#define PF          push_front
#define MP          make_pair
#define FI          first
#define SE          second
#define SIZE( A )   int( ( A ).size( ) )
#define ALL( A )    ( A ).begin( ), ( A ).end( )
#define ALLR( A )   ( A ).rbegin( ), ( A ).rend( )

using namespace std;

typedef long long           ll;
typedef unsigned long long  ull;
typedef long double         lf;
typedef pair< int, int >    pii;
typedef pair< ll, ll >      pll;
typedef vector< bool >      vb;
typedef vector< lf >        vd;
typedef vector< ll >        vll;
typedef vector< int >       vi;
typedef vector< pii >       vpii;

const int MAXN = int( 1e5 )+10;
const int MOD  = int( 360 );
const int oo   = INT_MAX;

int n;
int arr[ MAXN ], cur[ MAXN ];

/*
int get_gcd() {
  int r = cur[ 0 ];
  for( int i = 1; i < n; ++i ) {
    r = __gcd( r, cur[i] );
  }
  return r;
}

void go( int idx ) {
  if( idx == n ) {
    for( int i = 0; i < n; ++i ) {
      cout << cur[ i ] << " ";
    }
    int g = get_gcd();
    if( g != 1 ) {
      cout << g << " ---> ";
      for( int i = 0; i < n; ++i ) {
        cout << cur[ i ]/g << " ";
      }
    }
    cout << endl;
    return;
  }
  for( int i = 1; i <= arr[ idx ]; ++i ) {
    cur[ idx ] = i;
    go( idx+1 );
  }
}*/

int main( ) {

  #ifdef LOCAL
    freopen( "input", "r", stdin );
    //freopen( "output", "w", stdout );
  #else
    //freopen( "input", "r", stdin );
    //freopen( "output", "w", stdout );
    ios_base::sync_with_stdio( 0 );
    cin.tie( 0 );
  #endif

  while( cin >> n ) {
    int p = 0;
    for( int i = 0; i < n; ++i ) {
      cin >> arr[ i ];
      if( arr[i] != 1 ) p ^= ( arr[i]%2 );
    }
    if( p ) cout << "Second\n";
    else cout << "First\n";
  }

  return 0;
}

Submission Info

Judge Result